./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:04:15,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:04:15,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:04:15,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:04:15,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:04:15,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:04:15,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:04:15,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:04:15,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:04:15,520 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:04:15,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:04:15,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:04:15,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:04:15,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:04:15,523 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:04:15,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:04:15,525 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:04:15,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:04:15,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:04:15,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:04:15,527 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:04:15,528 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:04:15,528 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:04:15,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:04:15,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:04:15,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:04:15,530 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:04:15,531 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:04:15,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:04:15,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:04:15,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:04:15,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:04:15,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:15,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:04:15,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:04:15,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:04:15,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:04:15,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:04:15,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:04:15,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:04:15,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:04:15,537 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_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-24 22:04:15,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:04:15,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:04:15,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:04:15,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:04:15,808 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:04:15,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-24 22:04:18,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:04:19,235 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:04:19,236 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-24 22:04:19,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/03d517fc7/e4a6f3bc134d4c1fb5e85da9ebb23f16/FLAGb34c72ca2 [2023-11-24 22:04:19,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/03d517fc7/e4a6f3bc134d4c1fb5e85da9ebb23f16 [2023-11-24 22:04:19,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:04:19,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:04:19,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:19,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:04:19,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:04:19,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:19" (1/1) ... [2023-11-24 22:04:19,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac3238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:19, skipping insertion in model container [2023-11-24 22:04:19,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:19" (1/1) ... [2023-11-24 22:04:19,360 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:04:19,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:19,877 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:04:19,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:20,029 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:20,029 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:20,037 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:04:20,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20 WrapperNode [2023-11-24 22:04:20,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:20,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:20,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:04:20,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:04:20,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,145 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-11-24 22:04:20,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:20,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:04:20,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:04:20,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:04:20,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,211 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-24 22:04:20,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:04:20,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:04:20,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:04:20,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:04:20,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (1/1) ... [2023-11-24 22:04:20,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:04:20,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:04:20,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:04:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:04:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:04:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:04:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 22:04:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:04:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:04:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:04:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:04:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:04:20,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:04:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:04:20,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:04:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:04:20,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:04:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:04:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:04:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:04:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 22:04:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:04:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:04:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:04:20,343 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:04:20,540 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:04:20,542 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:04:20,990 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:04:21,364 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:04:21,364 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:04:21,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:21 BoogieIcfgContainer [2023-11-24 22:04:21,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:04:21,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:04:21,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:04:21,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:04:21,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:04:19" (1/3) ... [2023-11-24 22:04:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dc502d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:21, skipping insertion in model container [2023-11-24 22:04:21,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:20" (2/3) ... [2023-11-24 22:04:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dc502d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:21, skipping insertion in model container [2023-11-24 22:04:21,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:21" (3/3) ... [2023-11-24 22:04:21,375 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-24 22:04:21,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:04:21,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:04:21,395 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:04:21,444 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:04:21,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-24 22:04:21,531 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-24 22:04:21,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:21,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-24 22:04:21,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-24 22:04:21,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-24 22:04:21,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:04:21,569 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;@940326f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:04:21,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:04:21,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:04:21,573 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:04:21,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:21,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:21,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:21,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:21,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 12867, now seen corresponding path program 1 times [2023-11-24 22:04:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264127477] [2023-11-24 22:04:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:21,915 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-24 22:04:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264127477] [2023-11-24 22:04:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264127477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:21,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571216202] [2023-11-24 22:04:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:21,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:21,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:21,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:21,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:21,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:21,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:22,579 INFO L124 PetriNetUnfolderBase]: 868/1700 cut-off events. [2023-11-24 22:04:22,579 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:04:22,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1700 events. 868/1700 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11705 event pairs, 676 based on Foata normal form. 90/1578 useless extension candidates. Maximal degree in co-relation 3040. Up to 1029 conditions per place. [2023-11-24 22:04:22,606 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 22:04:22,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 187 flow [2023-11-24 22:04:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:22,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:22,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:22,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:22,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:22,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:22,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:22,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:22,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:22,639 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:22,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 187 flow [2023-11-24 22:04:22,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:04:22,652 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-24 22:04:22,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-24 22:04:22,659 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-24 22:04:22,659 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-24 22:04:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:22,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:22,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:04:22,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:22,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 12868, now seen corresponding path program 1 times [2023-11-24 22:04:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643760645] [2023-11-24 22:04:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:22,833 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-24 22:04:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643760645] [2023-11-24 22:04:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643760645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:22,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:22,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030160515] [2023-11-24 22:04:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:22,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:22,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:22,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:22,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:22,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:22,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:22,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:23,241 INFO L124 PetriNetUnfolderBase]: 868/1699 cut-off events. [2023-11-24 22:04:23,241 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:23,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1699 events. 868/1699 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11719 event pairs, 676 based on Foata normal form. 1/1488 useless extension candidates. Maximal degree in co-relation 3085. Up to 1028 conditions per place. [2023-11-24 22:04:23,260 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-24 22:04:23,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 184 flow [2023-11-24 22:04:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:23,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:23,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:23,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:23,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:23,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:23,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,277 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:23,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 184 flow [2023-11-24 22:04:23,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:23,283 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-24 22:04:23,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-24 22:04:23,285 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-24 22:04:23,286 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-24 22:04:23,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:23,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:23,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:04:23,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:23,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 383710773, now seen corresponding path program 1 times [2023-11-24 22:04:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:23,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673303723] [2023-11-24 22:04:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:04:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673303723] [2023-11-24 22:04:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673303723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:23,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:23,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:23,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894918100] [2023-11-24 22:04:23,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:23,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:23,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:23,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:23,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:23,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:23,775 INFO L124 PetriNetUnfolderBase]: 870/1682 cut-off events. [2023-11-24 22:04:23,775 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:23,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1682 events. 870/1682 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11567 event pairs, 691 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 3073. Up to 1029 conditions per place. [2023-11-24 22:04:23,793 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 22:04:23,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 184 flow [2023-11-24 22:04:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 22:04:23,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-11-24 22:04:23,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 22:04:23,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 22:04:23,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:23,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 22:04:23,800 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-24 22:04:23,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,803 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 122 transitions. [2023-11-24 22:04:23,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 184 flow [2023-11-24 22:04:23,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:23,808 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-24 22:04:23,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-24 22:04:23,810 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-24 22:04:23,810 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-24 22:04:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:23,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:04:23,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:23,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 383710774, now seen corresponding path program 1 times [2023-11-24 22:04:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702848784] [2023-11-24 22:04:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:23,957 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-24 22:04:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702848784] [2023-11-24 22:04:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702848784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:23,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:23,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187681735] [2023-11-24 22:04:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:23,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:23,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:23,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:23,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:23,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:23,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:24,336 INFO L124 PetriNetUnfolderBase]: 868/1693 cut-off events. [2023-11-24 22:04:24,336 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:04:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3092 conditions, 1693 events. 868/1693 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11750 event pairs, 504 based on Foata normal form. 3/1491 useless extension candidates. Maximal degree in co-relation 3082. Up to 1024 conditions per place. [2023-11-24 22:04:24,354 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:04:24,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 180 flow [2023-11-24 22:04:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:24,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:24,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:24,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:24,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:24,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:24,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,360 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:24,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 180 flow [2023-11-24 22:04:24,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:24,363 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:04:24,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:04:24,366 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-24 22:04:24,367 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:04:24,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:24,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:24,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:04:24,369 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:24,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908300, now seen corresponding path program 1 times [2023-11-24 22:04:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861881576] [2023-11-24 22:04:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:24,460 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-24 22:04:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861881576] [2023-11-24 22:04:24,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861881576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331509488] [2023-11-24 22:04:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:24,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:24,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:24,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:24,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:24,828 INFO L124 PetriNetUnfolderBase]: 890/1703 cut-off events. [2023-11-24 22:04:24,828 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:04:24,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3139 conditions, 1703 events. 890/1703 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11655 event pairs, 534 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 3129. Up to 1031 conditions per place. [2023-11-24 22:04:24,845 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 22:04:24,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 180 flow [2023-11-24 22:04:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 22:04:24,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-11-24 22:04:24,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 22:04:24,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 22:04:24,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:24,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 22:04:24,848 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-24 22:04:24,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,849 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 122 transitions. [2023-11-24 22:04:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 180 flow [2023-11-24 22:04:24,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:24,852 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:04:24,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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-24 22:04:24,853 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-24 22:04:24,853 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:04:24,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:24,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:24,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:04:24,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:24,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908299, now seen corresponding path program 1 times [2023-11-24 22:04:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774737290] [2023-11-24 22:04:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:24,931 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-24 22:04:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774737290] [2023-11-24 22:04:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774737290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:24,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729479439] [2023-11-24 22:04:24,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:24,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:24,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:24,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:24,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:24,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:24,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:24,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:25,311 INFO L124 PetriNetUnfolderBase]: 868/1651 cut-off events. [2023-11-24 22:04:25,311 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 22:04:25,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 1651 events. 868/1651 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11273 event pairs, 423 based on Foata normal form. 15/1499 useless extension candidates. Maximal degree in co-relation 3052. Up to 994 conditions per place. [2023-11-24 22:04:25,327 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 22:04:25,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-24 22:04:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:25,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:25,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:25,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:25,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:25,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:25,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,332 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:25,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-24 22:04:25,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:25,337 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 22:04:25,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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-24 22:04:25,340 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-24 22:04:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 22:04:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:25,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:04:25,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:25,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908006, now seen corresponding path program 1 times [2023-11-24 22:04:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875527390] [2023-11-24 22:04:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:25,461 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-24 22:04:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875527390] [2023-11-24 22:04:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875527390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124116523] [2023-11-24 22:04:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:25,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:25,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-24 22:04:25,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:25,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-24 22:04:25,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:25,752 INFO L124 PetriNetUnfolderBase]: 678/1323 cut-off events. [2023-11-24 22:04:25,752 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:25,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1323 events. 678/1323 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8366 event pairs, 216 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 2429. Up to 832 conditions per place. [2023-11-24 22:04:25,763 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 31 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-24 22:04:25,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 202 flow [2023-11-24 22:04:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-24 22:04:25,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2023-11-24 22:04:25,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-24 22:04:25,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-24 22:04:25,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:25,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-24 22:04:25,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,768 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 132 transitions. [2023-11-24 22:04:25,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 202 flow [2023-11-24 22:04:25,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:25,770 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-24 22:04:25,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-24 22:04:25,771 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-24 22:04:25,771 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-24 22:04:25,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:25,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:25,772 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-24 22:04:25,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:04:25,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:25,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1547996442, now seen corresponding path program 1 times [2023-11-24 22:04:25,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582246408] [2023-11-24 22:04:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:26,481 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-24 22:04:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582246408] [2023-11-24 22:04:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582246408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:04:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352743718] [2023-11-24 22:04:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:26,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:04:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:04:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:04:26,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:26,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:26,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:26,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:26,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:27,430 INFO L124 PetriNetUnfolderBase]: 1245/2332 cut-off events. [2023-11-24 22:04:27,430 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-11-24 22:04:27,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4368 conditions, 2332 events. 1245/2332 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16773 event pairs, 390 based on Foata normal form. 45/2291 useless extension candidates. Maximal degree in co-relation 4356. Up to 748 conditions per place. [2023-11-24 22:04:27,449 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 50 selfloop transitions, 5 changer transitions 10/84 dead transitions. [2023-11-24 22:04:27,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 316 flow [2023-11-24 22:04:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:04:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 22:04:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 262 transitions. [2023-11-24 22:04:27,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.656641604010025 [2023-11-24 22:04:27,451 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 262 transitions. [2023-11-24 22:04:27,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 262 transitions. [2023-11-24 22:04:27,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:27,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 262 transitions. [2023-11-24 22:04:27,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 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-24 22:04:27,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:27,454 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:27,454 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 7 states and 262 transitions. [2023-11-24 22:04:27,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 316 flow [2023-11-24 22:04:27,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:27,457 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 120 flow [2023-11-24 22:04:27,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-11-24 22:04:27,458 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-11-24 22:04:27,459 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 120 flow [2023-11-24 22:04:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:27,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:27,459 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-24 22:04:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:04:27,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:27,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1547997633, now seen corresponding path program 1 times [2023-11-24 22:04:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158745191] [2023-11-24 22:04:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:27,664 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-24 22:04:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158745191] [2023-11-24 22:04:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158745191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:04:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998176457] [2023-11-24 22:04:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:27,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:04:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:04:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:04:27,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:27,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:27,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:28,402 INFO L124 PetriNetUnfolderBase]: 2541/4342 cut-off events. [2023-11-24 22:04:28,403 INFO L125 PetriNetUnfolderBase]: For 240/252 co-relation queries the response was YES. [2023-11-24 22:04:28,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8482 conditions, 4342 events. 2541/4342 cut-off events. For 240/252 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 30431 event pairs, 255 based on Foata normal form. 156/4351 useless extension candidates. Maximal degree in co-relation 8467. Up to 2529 conditions per place. [2023-11-24 22:04:28,436 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 43 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2023-11-24 22:04:28,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 279 flow [2023-11-24 22:04:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:04:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:04:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2023-11-24 22:04:28,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.706140350877193 [2023-11-24 22:04:28,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 161 transitions. [2023-11-24 22:04:28,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 161 transitions. [2023-11-24 22:04:28,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:28,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 161 transitions. [2023-11-24 22:04:28,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:28,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:28,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:28,441 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 120 flow. Second operand 4 states and 161 transitions. [2023-11-24 22:04:28,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 279 flow [2023-11-24 22:04:28,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 272 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-24 22:04:28,447 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 148 flow [2023-11-24 22:04:28,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-24 22:04:28,448 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2023-11-24 22:04:28,448 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 148 flow [2023-11-24 22:04:28,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:28,449 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-24 22:04:28,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:04:28,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:28,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1028911032, now seen corresponding path program 1 times [2023-11-24 22:04:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:28,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366410281] [2023-11-24 22:04:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:28,675 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-24 22:04:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366410281] [2023-11-24 22:04:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366410281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:04:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168115646] [2023-11-24 22:04:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:28,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:04:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:04:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:04:28,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:28,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:28,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:28,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:29,175 INFO L124 PetriNetUnfolderBase]: 1637/2866 cut-off events. [2023-11-24 22:04:29,176 INFO L125 PetriNetUnfolderBase]: For 871/875 co-relation queries the response was YES. [2023-11-24 22:04:29,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6541 conditions, 2866 events. 1637/2866 cut-off events. For 871/875 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18142 event pairs, 119 based on Foata normal form. 128/2899 useless extension candidates. Maximal degree in co-relation 6525. Up to 1269 conditions per place. [2023-11-24 22:04:29,199 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 53 selfloop transitions, 8 changer transitions 1/82 dead transitions. [2023-11-24 22:04:29,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 82 transitions, 371 flow [2023-11-24 22:04:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:04:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:04:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2023-11-24 22:04:29,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7087719298245614 [2023-11-24 22:04:29,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 202 transitions. [2023-11-24 22:04:29,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 202 transitions. [2023-11-24 22:04:29,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:29,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 202 transitions. [2023-11-24 22:04:29,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,204 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 148 flow. Second operand 5 states and 202 transitions. [2023-11-24 22:04:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 82 transitions, 371 flow [2023-11-24 22:04:29,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 361 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:29,210 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 188 flow [2023-11-24 22:04:29,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-11-24 22:04:29,212 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-11-24 22:04:29,212 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 188 flow [2023-11-24 22:04:29,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:29,212 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-24 22:04:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:04:29,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:29,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1645187956, now seen corresponding path program 1 times [2023-11-24 22:04:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178306358] [2023-11-24 22:04:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:29,626 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-24 22:04:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178306358] [2023-11-24 22:04:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178306358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:29,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:29,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:04:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184112337] [2023-11-24 22:04:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:29,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:04:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:04:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:04:29,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:29,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:29,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:29,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:29,973 INFO L124 PetriNetUnfolderBase]: 877/1534 cut-off events. [2023-11-24 22:04:29,974 INFO L125 PetriNetUnfolderBase]: For 1278/1278 co-relation queries the response was YES. [2023-11-24 22:04:29,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1534 events. 877/1534 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7937 event pairs, 93 based on Foata normal form. 68/1531 useless extension candidates. Maximal degree in co-relation 3961. Up to 484 conditions per place. [2023-11-24 22:04:29,984 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 47 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2023-11-24 22:04:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 382 flow [2023-11-24 22:04:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:04:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:04:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2023-11-24 22:04:29,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6637426900584795 [2023-11-24 22:04:29,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 227 transitions. [2023-11-24 22:04:29,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 227 transitions. [2023-11-24 22:04:29,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:29,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 227 transitions. [2023-11-24 22:04:29,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,989 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:29,989 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 188 flow. Second operand 6 states and 227 transitions. [2023-11-24 22:04:29,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 382 flow [2023-11-24 22:04:29,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 352 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-24 22:04:29,999 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 198 flow [2023-11-24 22:04:29,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-11-24 22:04:30,000 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-11-24 22:04:30,000 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 198 flow [2023-11-24 22:04:30,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:30,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:30,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:30,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:04:30,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:30,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1707517335, now seen corresponding path program 1 times [2023-11-24 22:04:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020975722] [2023-11-24 22:04:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:30,733 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-24 22:04:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020975722] [2023-11-24 22:04:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020975722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:04:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652578343] [2023-11-24 22:04:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:04:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:04:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:04:30,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-24 22:04:30,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:30,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:30,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-24 22:04:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:31,516 INFO L124 PetriNetUnfolderBase]: 1631/2997 cut-off events. [2023-11-24 22:04:31,516 INFO L125 PetriNetUnfolderBase]: For 1552/1592 co-relation queries the response was YES. [2023-11-24 22:04:31,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2997 events. 1631/2997 cut-off events. For 1552/1592 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18877 event pairs, 415 based on Foata normal form. 16/2927 useless extension candidates. Maximal degree in co-relation 6952. Up to 1360 conditions per place. [2023-11-24 22:04:31,536 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 60 selfloop transitions, 11 changer transitions 7/102 dead transitions. [2023-11-24 22:04:31,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 499 flow [2023-11-24 22:04:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:04:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:04:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 291 transitions. [2023-11-24 22:04:31,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6381578947368421 [2023-11-24 22:04:31,539 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 291 transitions. [2023-11-24 22:04:31,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 291 transitions. [2023-11-24 22:04:31,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:31,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 291 transitions. [2023-11-24 22:04:31,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:31,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:31,543 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:31,543 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 198 flow. Second operand 8 states and 291 transitions. [2023-11-24 22:04:31,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 499 flow [2023-11-24 22:04:31,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 435 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-24 22:04:31,570 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 222 flow [2023-11-24 22:04:31,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-24 22:04:31,572 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2023-11-24 22:04:31,572 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 222 flow [2023-11-24 22:04:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:31,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:31,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:04:31,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:31,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1924425198, now seen corresponding path program 1 times [2023-11-24 22:04:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904137785] [2023-11-24 22:04:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:32,812 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-24 22:04:32,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904137785] [2023-11-24 22:04:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904137785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:04:32,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482477366] [2023-11-24 22:04:32,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:32,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:04:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:04:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:04:32,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2023-11-24 22:04:32,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 222 flow. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:32,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:32,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2023-11-24 22:04:32,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:33,535 INFO L124 PetriNetUnfolderBase]: 1169/2307 cut-off events. [2023-11-24 22:04:33,536 INFO L125 PetriNetUnfolderBase]: For 503/520 co-relation queries the response was YES. [2023-11-24 22:04:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5043 conditions, 2307 events. 1169/2307 cut-off events. For 503/520 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14535 event pairs, 723 based on Foata normal form. 20/2156 useless extension candidates. Maximal degree in co-relation 5022. Up to 1638 conditions per place. [2023-11-24 22:04:33,548 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 22 selfloop transitions, 6 changer transitions 28/84 dead transitions. [2023-11-24 22:04:33,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 84 transitions, 421 flow [2023-11-24 22:04:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:04:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:04:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2023-11-24 22:04:33,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5570175438596491 [2023-11-24 22:04:33,551 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 254 transitions. [2023-11-24 22:04:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 254 transitions. [2023-11-24 22:04:33,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:33,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 254 transitions. [2023-11-24 22:04:33,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:33,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:33,554 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:33,554 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 222 flow. Second operand 8 states and 254 transitions. [2023-11-24 22:04:33,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 84 transitions, 421 flow [2023-11-24 22:04:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 22:04:33,559 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 209 flow [2023-11-24 22:04:33,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2023-11-24 22:04:33,560 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2023-11-24 22:04:33,560 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 209 flow [2023-11-24 22:04:33,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:33,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:33,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:33,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 22:04:33,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:33,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash -822995679, now seen corresponding path program 2 times [2023-11-24 22:04:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313065780] [2023-11-24 22:04:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:34,184 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-24 22:04:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313065780] [2023-11-24 22:04:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313065780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 22:04:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949963753] [2023-11-24 22:04:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:34,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:04:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:04:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:04:34,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-24 22:04:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-24 22:04:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:35,104 INFO L124 PetriNetUnfolderBase]: 2332/4258 cut-off events. [2023-11-24 22:04:35,105 INFO L125 PetriNetUnfolderBase]: For 1762/1762 co-relation queries the response was YES. [2023-11-24 22:04:35,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9713 conditions, 4258 events. 2332/4258 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30111 event pairs, 458 based on Foata normal form. 16/4119 useless extension candidates. Maximal degree in co-relation 9689. Up to 1829 conditions per place. [2023-11-24 22:04:35,130 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 29 selfloop transitions, 4 changer transitions 30/86 dead transitions. [2023-11-24 22:04:35,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 427 flow [2023-11-24 22:04:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 22:04:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 22:04:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2023-11-24 22:04:35,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6030701754385965 [2023-11-24 22:04:35,133 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 275 transitions. [2023-11-24 22:04:35,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 275 transitions. [2023-11-24 22:04:35,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:35,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 275 transitions. [2023-11-24 22:04:35,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:35,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:35,137 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:35,137 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 209 flow. Second operand 8 states and 275 transitions. [2023-11-24 22:04:35,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 427 flow [2023-11-24 22:04:35,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 86 transitions, 414 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-24 22:04:35,146 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 197 flow [2023-11-24 22:04:35,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2023-11-24 22:04:35,148 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2023-11-24 22:04:35,148 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 197 flow [2023-11-24 22:04:35,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:35,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:35,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:35,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 22:04:35,150 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:35,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1743403513, now seen corresponding path program 3 times [2023-11-24 22:04:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:35,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560266058] [2023-11-24 22:04:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:37,117 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-24 22:04:37,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:37,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560266058] [2023-11-24 22:04:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560266058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 22:04:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592850380] [2023-11-24 22:04:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:37,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 22:04:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:04:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 22:04:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-24 22:04:37,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-24 22:04:37,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 51 transitions, 197 flow. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 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-24 22:04:37,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:37,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-24 22:04:37,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:38,056 INFO L124 PetriNetUnfolderBase]: 1396/2680 cut-off events. [2023-11-24 22:04:38,057 INFO L125 PetriNetUnfolderBase]: For 829/840 co-relation queries the response was YES. [2023-11-24 22:04:38,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6278 conditions, 2680 events. 1396/2680 cut-off events. For 829/840 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17637 event pairs, 247 based on Foata normal form. 16/2584 useless extension candidates. Maximal degree in co-relation 6254. Up to 813 conditions per place. [2023-11-24 22:04:38,073 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 32 selfloop transitions, 7 changer transitions 32/94 dead transitions. [2023-11-24 22:04:38,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 94 transitions, 479 flow [2023-11-24 22:04:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 22:04:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 22:04:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 312 transitions. [2023-11-24 22:04:38,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6081871345029239 [2023-11-24 22:04:38,076 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 312 transitions. [2023-11-24 22:04:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 312 transitions. [2023-11-24 22:04:38,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:38,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 312 transitions. [2023-11-24 22:04:38,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:38,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:38,082 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 57.0) internal successors, (570), 10 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:38,082 INFO L175 Difference]: Start difference. First operand has 79 places, 51 transitions, 197 flow. Second operand 9 states and 312 transitions. [2023-11-24 22:04:38,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 94 transitions, 479 flow [2023-11-24 22:04:38,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 442 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-11-24 22:04:38,088 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 206 flow [2023-11-24 22:04:38,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2023-11-24 22:04:38,090 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2023-11-24 22:04:38,090 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 206 flow [2023-11-24 22:04:38,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 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-24 22:04:38,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:38,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:38,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 22:04:38,091 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:38,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1499492415, now seen corresponding path program 4 times [2023-11-24 22:04:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925987591] [2023-11-24 22:04:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:04:38,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:04:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:04:38,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 22:04:38,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:04:38,300 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 22:04:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 22:04:38,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 22:04:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 22:04:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 22:04:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 22:04:38,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 22:04:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 22:04:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 22:04:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 22:04:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 22:04:38,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 22:04:38,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 22:04:38,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 22:04:38,305 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:38,312 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:04:38,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:04:38,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 22:04:38,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:04:38,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:04:38,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:04:38,432 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:04:38,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:04:38 BasicIcfg [2023-11-24 22:04:38,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:04:38,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:04:38,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:04:38,454 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:04:38,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:21" (3/4) ... [2023-11-24 22:04:38,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:04:38,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:04:38,459 INFO L158 Benchmark]: Toolchain (without parser) took 19167.17ms. Allocated memory was 178.3MB in the beginning and 469.8MB in the end (delta: 291.5MB). Free memory was 136.5MB in the beginning and 240.2MB in the end (delta: -103.7MB). Peak memory consumption was 189.4MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,459 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 138.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:04:38,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.23ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 112.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.94ms. Allocated memory is still 178.3MB. Free memory was 112.4MB in the beginning and 109.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,460 INFO L158 Benchmark]: Boogie Preprocessor took 93.87ms. Allocated memory is still 178.3MB. Free memory was 109.2MB in the beginning and 105.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,461 INFO L158 Benchmark]: RCFGBuilder took 1124.81ms. Allocated memory is still 178.3MB. Free memory was 105.6MB in the beginning and 121.0MB in the end (delta: -15.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,461 INFO L158 Benchmark]: TraceAbstraction took 17085.74ms. Allocated memory was 178.3MB in the beginning and 469.8MB in the end (delta: 291.5MB). Free memory was 120.0MB in the beginning and 240.2MB in the end (delta: -120.2MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2023-11-24 22:04:38,461 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 469.8MB. Free memory is still 240.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:04:38,464 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.26ms. Allocated memory is still 138.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.23ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 112.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.94ms. Allocated memory is still 178.3MB. Free memory was 112.4MB in the beginning and 109.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.87ms. Allocated memory is still 178.3MB. Free memory was 109.2MB in the beginning and 105.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1124.81ms. Allocated memory is still 178.3MB. Free memory was 105.6MB in the beginning and 121.0MB in the end (delta: -15.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17085.74ms. Allocated memory was 178.3MB in the beginning and 469.8MB in the end (delta: 291.5MB). Free memory was 120.0MB in the beginning and 240.2MB in the end (delta: -120.2MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 469.8MB. Free memory is still 240.2MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: 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, 85 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: 16.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2186 IncrementalHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 30 mSDtfsCounter, 2186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=12, InterpolantAutomatonStates: 76, 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.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 2781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-24 22:04:38,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:04:41,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:04:41,253 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 22:04:41,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:04:41,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:04:41,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:04:41,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:04:41,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:04:41,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:04:41,315 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:04:41,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:04:41,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:04:41,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:04:41,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:04:41,319 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:04:41,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:04:41,319 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:04:41,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:04:41,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:04:41,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:04:41,322 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:04:41,322 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:04:41,323 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:04:41,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:04:41,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:04:41,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 22:04:41,324 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 22:04:41,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:04:41,325 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:04:41,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:04:41,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:04:41,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:04:41,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:04:41,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:04:41,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:41,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:04:41,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:04:41,330 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 22:04:41,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 22:04:41,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:04:41,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:04:41,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:04:41,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:04:41,332 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 22:04:41,332 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_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-11-24 22:04:41,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:04:41,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:04:41,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:04:41,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:04:41,778 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:04:41,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-24 22:04:44,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:04:45,297 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:04:45,298 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-11-24 22:04:45,321 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/19ce48a6d/493b8bec9e744d62bcccf8ea642c35c1/FLAGbbc41ffc2 [2023-11-24 22:04:45,342 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/data/19ce48a6d/493b8bec9e744d62bcccf8ea642c35c1 [2023-11-24 22:04:45,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:04:45,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:04:45,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:45,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:04:45,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:04:45,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:45" (1/1) ... [2023-11-24 22:04:45,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77867525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:45, skipping insertion in model container [2023-11-24 22:04:45,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:04:45" (1/1) ... [2023-11-24 22:04:45,442 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:04:46,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:46,046 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:04:46,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:04:46,216 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:46,217 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:04:46,225 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:04:46,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46 WrapperNode [2023-11-24 22:04:46,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:04:46,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:46,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:04:46,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:04:46,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,310 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-11-24 22:04:46,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:04:46,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:04:46,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:04:46,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:04:46,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,384 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-24 22:04:46,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:04:46,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:04:46,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:04:46,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:04:46,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (1/1) ... [2023-11-24 22:04:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:04:46,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:04:46,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:04:46,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:04:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 22:04:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 22:04:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 22:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 22:04:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 22:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 22:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 22:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 22:04:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 22:04:46,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 22:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 22:04:46,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 22:04:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 22:04:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 22:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:04:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:04:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:04:46,540 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:04:46,805 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:04:46,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:04:47,328 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:04:47,534 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:04:47,534 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 22:04:47,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:47 BoogieIcfgContainer [2023-11-24 22:04:47,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:04:47,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:04:47,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:04:47,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:04:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:04:45" (1/3) ... [2023-11-24 22:04:47,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a7622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:47, skipping insertion in model container [2023-11-24 22:04:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:04:46" (2/3) ... [2023-11-24 22:04:47,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a7622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:04:47, skipping insertion in model container [2023-11-24 22:04:47,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:47" (3/3) ... [2023-11-24 22:04:47,544 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-11-24 22:04:47,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:04:47,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 22:04:47,579 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:04:47,634 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 22:04:47,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-24 22:04:47,705 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-24 22:04:47,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:47,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-24 22:04:47,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-24 22:04:47,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-24 22:04:47,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:04:47,736 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;@50be6b1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:04:47,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 22:04:47,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:04:47,740 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:04:47,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:04:47,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:47,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:47,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:47,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 12931, now seen corresponding path program 1 times [2023-11-24 22:04:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029065250] [2023-11-24 22:04:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:47,762 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-24 22:04:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:47,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:47,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:47,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:04:47,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:48,050 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-24 22:04:48,063 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-24 22:04:48,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:48,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:48,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029065250] [2023-11-24 22:04:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029065250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:48,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652334864] [2023-11-24 22:04:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:48,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:48,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:48,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:48,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:48,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:48,703 INFO L124 PetriNetUnfolderBase]: 868/1700 cut-off events. [2023-11-24 22:04:48,704 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 22:04:48,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1700 events. 868/1700 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11705 event pairs, 676 based on Foata normal form. 90/1578 useless extension candidates. Maximal degree in co-relation 3040. Up to 1029 conditions per place. [2023-11-24 22:04:48,727 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 22:04:48,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 187 flow [2023-11-24 22:04:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:48,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:48,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:48,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:48,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:48,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:48,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:48,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:48,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:48,758 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:48,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 187 flow [2023-11-24 22:04:48,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 22:04:48,766 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-24 22:04:48,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-24 22:04:48,772 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-24 22:04:48,772 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-24 22:04:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:48,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:48,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:04:48,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:48,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:48,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 12932, now seen corresponding path program 1 times [2023-11-24 22:04:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045284409] [2023-11-24 22:04:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:48,979 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-24 22:04:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:48,981 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:49,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:49,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:04:49,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:49,127 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-24 22:04:49,138 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-24 22:04:49,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:49,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045284409] [2023-11-24 22:04:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045284409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480648324] [2023-11-24 22:04:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:49,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:49,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:49,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:49,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:49,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:49,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:49,574 INFO L124 PetriNetUnfolderBase]: 868/1699 cut-off events. [2023-11-24 22:04:49,575 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1699 events. 868/1699 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11719 event pairs, 676 based on Foata normal form. 1/1488 useless extension candidates. Maximal degree in co-relation 3085. Up to 1028 conditions per place. [2023-11-24 22:04:49,594 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-24 22:04:49,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 184 flow [2023-11-24 22:04:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:49,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:49,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:49,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:49,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:49,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:49,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:49,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:49,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:49,602 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:49,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 184 flow [2023-11-24 22:04:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:49,607 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-24 22:04:49,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-24 22:04:49,609 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-24 22:04:49,609 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-24 22:04:49,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:49,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:49,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:49,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:49,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:49,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:49,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash 385619383, now seen corresponding path program 1 times [2023-11-24 22:04:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:49,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689351666] [2023-11-24 22:04:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:49,823 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-24 22:04:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:49,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:49,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:49,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:04:49,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:49,973 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-24 22:04:49,980 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-24 22:04:49,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:49,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:49,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689351666] [2023-11-24 22:04:49,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689351666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:49,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:49,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683384321] [2023-11-24 22:04:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:50,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:50,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:50,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:50,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:50,368 INFO L124 PetriNetUnfolderBase]: 870/1682 cut-off events. [2023-11-24 22:04:50,368 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:50,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1682 events. 870/1682 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11567 event pairs, 691 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 3073. Up to 1029 conditions per place. [2023-11-24 22:04:50,384 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 22:04:50,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 184 flow [2023-11-24 22:04:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 22:04:50,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-11-24 22:04:50,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 22:04:50,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 22:04:50,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:50,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 22:04:50,389 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-24 22:04:50,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:50,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:50,391 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 122 transitions. [2023-11-24 22:04:50,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 184 flow [2023-11-24 22:04:50,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:50,395 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-24 22:04:50,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-24 22:04:50,396 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-24 22:04:50,396 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-24 22:04:50,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:50,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:50,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:04:50,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:50,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:50,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:50,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 385619384, now seen corresponding path program 1 times [2023-11-24 22:04:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:50,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895347332] [2023-11-24 22:04:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:50,602 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-24 22:04:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:50,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:50,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:50,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:04:50,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:50,730 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-24 22:04:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:04:50,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:50,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895347332] [2023-11-24 22:04:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895347332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:50,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:50,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4882286] [2023-11-24 22:04:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:50,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:50,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:50,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:50,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:50,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:51,109 INFO L124 PetriNetUnfolderBase]: 868/1677 cut-off events. [2023-11-24 22:04:51,109 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:04:51,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1677 events. 868/1677 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11608 event pairs, 689 based on Foata normal form. 3/1475 useless extension candidates. Maximal degree in co-relation 3066. Up to 1024 conditions per place. [2023-11-24 22:04:51,127 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 22:04:51,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 180 flow [2023-11-24 22:04:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:51,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:51,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:51,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:51,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:51,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:51,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,146 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:51,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 180 flow [2023-11-24 22:04:51,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:51,150 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-24 22:04:51,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-24 22:04:51,153 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-24 22:04:51,153 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-24 22:04:51,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:51,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:51,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:51,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:51,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:51,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080652, now seen corresponding path program 1 times [2023-11-24 22:04:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378990635] [2023-11-24 22:04:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:51,360 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-24 22:04:51,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:51,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:51,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:51,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:04:51,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:51,498 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-24 22:04:51,510 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-24 22:04:51,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:51,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378990635] [2023-11-24 22:04:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378990635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015234164] [2023-11-24 22:04:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:51,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:51,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:51,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:51,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:51,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:51,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:51,877 INFO L124 PetriNetUnfolderBase]: 890/1700 cut-off events. [2023-11-24 22:04:51,877 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 22:04:51,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1700 events. 890/1700 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11696 event pairs, 324 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 3126. Up to 1031 conditions per place. [2023-11-24 22:04:51,893 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 22:04:51,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 180 flow [2023-11-24 22:04:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 22:04:51,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-11-24 22:04:51,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 22:04:51,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 22:04:51,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:51,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 22:04:51,896 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-24 22:04:51,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,898 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 122 transitions. [2023-11-24 22:04:51,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 180 flow [2023-11-24 22:04:51,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:51,901 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 22:04:51,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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-24 22:04:51,902 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-24 22:04:51,902 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 22:04:51,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:51,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:51,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:51,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:52,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,106 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:52,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080651, now seen corresponding path program 1 times [2023-11-24 22:04:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559783233] [2023-11-24 22:04:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:52,107 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-24 22:04:52,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:52,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:52,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:04:52,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:52,238 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-24 22:04:52,250 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-24 22:04:52,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:52,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559783233] [2023-11-24 22:04:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559783233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:04:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278670509] [2023-11-24 22:04:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:52,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:52,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-24 22:04:52,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:52,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-24 22:04:52,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:52,590 INFO L124 PetriNetUnfolderBase]: 868/1663 cut-off events. [2023-11-24 22:04:52,590 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 22:04:52,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 1663 events. 868/1663 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11455 event pairs, 324 based on Foata normal form. 15/1511 useless extension candidates. Maximal degree in co-relation 3064. Up to 994 conditions per place. [2023-11-24 22:04:52,606 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 22:04:52,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-24 22:04:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-24 22:04:52,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-24 22:04:52,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-24 22:04:52,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-24 22:04:52,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:52,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-24 22:04:52,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,610 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 124 transitions. [2023-11-24 22:04:52,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-24 22:04:52,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:52,613 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 22:04:52,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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-24 22:04:52,614 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-24 22:04:52,615 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 22:04:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:52,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:52,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:52,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:52,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080358, now seen corresponding path program 1 times [2023-11-24 22:04:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102122954] [2023-11-24 22:04:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:52,820 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-24 22:04:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:52,821 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:52,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:04:52,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:52,947 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-24 22:04:52,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:52,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102122954] [2023-11-24 22:04:52,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102122954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:52,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:52,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:04:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374372326] [2023-11-24 22:04:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:52,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:04:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:52,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:04:52,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:04:52,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-24 22:04:52,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:52,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:52,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-24 22:04:52,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:53,201 INFO L124 PetriNetUnfolderBase]: 678/1323 cut-off events. [2023-11-24 22:04:53,201 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-24 22:04:53,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1323 events. 678/1323 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8406 event pairs, 216 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 2429. Up to 832 conditions per place. [2023-11-24 22:04:53,213 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 31 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-24 22:04:53,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 202 flow [2023-11-24 22:04:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:04:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:04:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-24 22:04:53,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2023-11-24 22:04:53,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-24 22:04:53,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-24 22:04:53,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:53,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-24 22:04:53,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:53,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:53,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:53,219 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 132 transitions. [2023-11-24 22:04:53,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 202 flow [2023-11-24 22:04:53,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:53,222 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-24 22:04:53,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-24 22:04:53,224 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-24 22:04:53,224 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-24 22:04:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:53,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:53,225 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-24 22:04:53,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:53,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:53,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:53,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 632704858, now seen corresponding path program 1 times [2023-11-24 22:04:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447486720] [2023-11-24 22:04:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:53,429 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-24 22:04:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:53,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:53,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:53,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 22:04:53,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:53,614 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-24 22:04:53,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:53,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447486720] [2023-11-24 22:04:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447486720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:53,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:04:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583947264] [2023-11-24 22:04:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:53,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:04:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:04:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:04:53,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:53,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:53,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:53,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:53,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:54,093 INFO L124 PetriNetUnfolderBase]: 1509/2596 cut-off events. [2023-11-24 22:04:54,093 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-11-24 22:04:54,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 2596 events. 1509/2596 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16674 event pairs, 147 based on Foata normal form. 80/2592 useless extension candidates. Maximal degree in co-relation 5053. Up to 1513 conditions per place. [2023-11-24 22:04:54,120 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 41 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2023-11-24 22:04:54,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 244 flow [2023-11-24 22:04:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:04:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:04:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2023-11-24 22:04:54,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.706140350877193 [2023-11-24 22:04:54,123 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 161 transitions. [2023-11-24 22:04:54,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 161 transitions. [2023-11-24 22:04:54,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:54,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 161 transitions. [2023-11-24 22:04:54,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,126 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,126 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 4 states and 161 transitions. [2023-11-24 22:04:54,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 244 flow [2023-11-24 22:04:54,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:54,129 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 126 flow [2023-11-24 22:04:54,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-24 22:04:54,132 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-24 22:04:54,132 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 126 flow [2023-11-24 22:04:54,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:54,133 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-24 22:04:54,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-24 22:04:54,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:54,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:54,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1319710493, now seen corresponding path program 1 times [2023-11-24 22:04:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402034232] [2023-11-24 22:04:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:54,338 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-24 22:04:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:54,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:54,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:54,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 22:04:54,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:54,541 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-24 22:04:54,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:54,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402034232] [2023-11-24 22:04:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402034232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:04:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974413450] [2023-11-24 22:04:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:04:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:04:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:04:54,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:54,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:54,923 INFO L124 PetriNetUnfolderBase]: 945/1668 cut-off events. [2023-11-24 22:04:54,923 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2023-11-24 22:04:54,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 1668 events. 945/1668 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9481 event pairs, 73 based on Foata normal form. 68/1681 useless extension candidates. Maximal degree in co-relation 3693. Up to 729 conditions per place. [2023-11-24 22:04:54,935 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 51 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2023-11-24 22:04:54,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 333 flow [2023-11-24 22:04:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:04:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 22:04:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2023-11-24 22:04:54,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7087719298245614 [2023-11-24 22:04:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 202 transitions. [2023-11-24 22:04:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 202 transitions. [2023-11-24 22:04:54,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:54,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 202 transitions. [2023-11-24 22:04:54,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,943 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 126 flow. Second operand 5 states and 202 transitions. [2023-11-24 22:04:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 333 flow [2023-11-24 22:04:54,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 22:04:54,950 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 166 flow [2023-11-24 22:04:54,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-11-24 22:04:54,953 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-24 22:04:54,953 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 166 flow [2023-11-24 22:04:54,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:54,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:54,954 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-24 22:04:54,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:55,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -128258011, now seen corresponding path program 1 times [2023-11-24 22:04:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661404655] [2023-11-24 22:04:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:55,165 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-24 22:04:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:55,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:55,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 22:04:55,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:55,412 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-24 22:04:55,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:55,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661404655] [2023-11-24 22:04:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661404655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:04:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914827740] [2023-11-24 22:04:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:55,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:04:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:04:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:04:55,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2023-11-24 22:04:55,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:55,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:55,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2023-11-24 22:04:55,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:55,763 INFO L124 PetriNetUnfolderBase]: 501/884 cut-off events. [2023-11-24 22:04:55,763 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2023-11-24 22:04:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 884 events. 501/884 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4064 event pairs, 59 based on Foata normal form. 36/878 useless extension candidates. Maximal degree in co-relation 2221. Up to 268 conditions per place. [2023-11-24 22:04:55,770 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 45 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2023-11-24 22:04:55,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 344 flow [2023-11-24 22:04:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:04:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:04:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2023-11-24 22:04:55,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6637426900584795 [2023-11-24 22:04:55,772 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 227 transitions. [2023-11-24 22:04:55,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 227 transitions. [2023-11-24 22:04:55,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:55,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 227 transitions. [2023-11-24 22:04:55,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:55,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:55,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:55,776 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 166 flow. Second operand 6 states and 227 transitions. [2023-11-24 22:04:55,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 344 flow [2023-11-24 22:04:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-24 22:04:55,782 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 180 flow [2023-11-24 22:04:55,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-24 22:04:55,783 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-11-24 22:04:55,783 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 180 flow [2023-11-24 22:04:55,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:55,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:55,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:55,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:55,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1287320950, now seen corresponding path program 1 times [2023-11-24 22:04:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555076384] [2023-11-24 22:04:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:55,988 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-24 22:04:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:55,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:55,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:56,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 22:04:56,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:56,953 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t893~0#1.base_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ bv0 1)) |v_ULTIMATE.start_main_~#t893~0#1.base_33| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t892~0#1.base_43|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ bv1 1)) |v_ULTIMATE.start_main_~#t893~0#1.base_33|) (_ bv0 1))))) is different from true [2023-11-24 22:04:56,954 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-24 22:04:56,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:56,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:56,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555076384] [2023-11-24 22:04:56,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555076384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:56,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:56,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:04:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130576527] [2023-11-24 22:04:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:56,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:04:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:04:56,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-24 22:04:57,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2023-11-24 22:04:57,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:57,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2023-11-24 22:04:57,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:57,335 INFO L124 PetriNetUnfolderBase]: 290/632 cut-off events. [2023-11-24 22:04:57,335 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2023-11-24 22:04:57,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 632 events. 290/632 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3136 event pairs, 63 based on Foata normal form. 8/593 useless extension candidates. Maximal degree in co-relation 1306. Up to 403 conditions per place. [2023-11-24 22:04:57,345 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-11-24 22:04:57,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 280 flow [2023-11-24 22:04:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:04:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:04:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2023-11-24 22:04:57,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49707602339181284 [2023-11-24 22:04:57,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 170 transitions. [2023-11-24 22:04:57,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 170 transitions. [2023-11-24 22:04:57,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:57,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 170 transitions. [2023-11-24 22:04:57,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,351 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,351 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 180 flow. Second operand 6 states and 170 transitions. [2023-11-24 22:04:57,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 280 flow [2023-11-24 22:04:57,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 224 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-24 22:04:57,354 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 156 flow [2023-11-24 22:04:57,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-11-24 22:04:57,355 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-11-24 22:04:57,355 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 156 flow [2023-11-24 22:04:57,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:57,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:57,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:57,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:57,560 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:57,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2126983571, now seen corresponding path program 1 times [2023-11-24 22:04:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:57,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684318859] [2023-11-24 22:04:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:57,561 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-24 22:04:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:57,562 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:57,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:57,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 22:04:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:57,832 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-24 22:04:57,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 22:04:57,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 22:04:57,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684318859] [2023-11-24 22:04:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684318859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:04:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:04:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:04:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268813060] [2023-11-24 22:04:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:04:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:04:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 22:04:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:04:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:04:57,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-24 22:04:57,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:57,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:04:57,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-24 22:04:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:04:58,216 INFO L124 PetriNetUnfolderBase]: 654/1256 cut-off events. [2023-11-24 22:04:58,217 INFO L125 PetriNetUnfolderBase]: For 372/398 co-relation queries the response was YES. [2023-11-24 22:04:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2938 conditions, 1256 events. 654/1256 cut-off events. For 372/398 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6595 event pairs, 178 based on Foata normal form. 8/1219 useless extension candidates. Maximal degree in co-relation 2925. Up to 531 conditions per place. [2023-11-24 22:04:58,225 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 53 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2023-11-24 22:04:58,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 380 flow [2023-11-24 22:04:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:04:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:04:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2023-11-24 22:04:58,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6812865497076024 [2023-11-24 22:04:58,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 233 transitions. [2023-11-24 22:04:58,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 233 transitions. [2023-11-24 22:04:58,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:04:58,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 233 transitions. [2023-11-24 22:04:58,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:58,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:58,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:58,231 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 156 flow. Second operand 6 states and 233 transitions. [2023-11-24 22:04:58,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 380 flow [2023-11-24 22:04:58,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 362 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 22:04:58,235 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 185 flow [2023-11-24 22:04:58,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-24 22:04:58,236 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-11-24 22:04:58,236 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 185 flow [2023-11-24 22:04:58,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:04:58,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:04:58,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:58,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:58,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:58,441 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 22:04:58,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash 16050503, now seen corresponding path program 2 times [2023-11-24 22:04:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 22:04:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088465887] [2023-11-24 22:04:58,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 22:04:58,442 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-24 22:04:58,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 22:04:58,443 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:58,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:58,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 22:04:58,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 22:04:58,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:04:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:04:58,831 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 22:04:58,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 22:04:58,832 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 22:04:58,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 22:04:58,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 22:04:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 22:04:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 22:04:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 22:04:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 22:04:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 22:04:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 22:04:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 22:04:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 22:04:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 22:04:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 22:04:58,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:59,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/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-24 22:04:59,041 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:04:59,047 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 22:04:59,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 22:04:59,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-24 22:04:59,133 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 22:04:59,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 22:04:59,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:04:59,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 22:04:59,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 10:04:59 BasicIcfg [2023-11-24 22:04:59,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 22:04:59,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 22:04:59,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 22:04:59,178 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 22:04:59,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:04:47" (3/4) ... [2023-11-24 22:04:59,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 22:04:59,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 22:04:59,183 INFO L158 Benchmark]: Toolchain (without parser) took 13833.35ms. Allocated memory was 67.1MB in the beginning and 197.1MB in the end (delta: 130.0MB). Free memory was 41.9MB in the beginning and 115.3MB in the end (delta: -73.4MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,183 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 114.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.22ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 55.7MB in the end (delta: -14.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.71ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 53.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,187 INFO L158 Benchmark]: Boogie Preprocessor took 122.67ms. Allocated memory is still 90.2MB. Free memory was 53.1MB in the beginning and 49.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,188 INFO L158 Benchmark]: RCFGBuilder took 1094.01ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 39.0MB in the end (delta: 10.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,188 INFO L158 Benchmark]: TraceAbstraction took 11640.62ms. Allocated memory was 90.2MB in the beginning and 197.1MB in the end (delta: 107.0MB). Free memory was 38.4MB in the beginning and 116.3MB in the end (delta: -77.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-24 22:04:59,188 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 197.1MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 22:04:59,190 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 114.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.22ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 55.7MB in the end (delta: -14.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.71ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 53.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.67ms. Allocated memory is still 90.2MB. Free memory was 53.1MB in the beginning and 49.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.01ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 39.0MB in the end (delta: 10.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11640.62ms. Allocated memory was 90.2MB in the beginning and 197.1MB in the end (delta: 107.0MB). Free memory was 38.4MB in the beginning and 116.3MB in the end (delta: -77.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 197.1MB. Free memory is still 115.3MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: 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, 85 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 441 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 15 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, InterpolantAutomatonStates: 48, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 171 ConstructedInterpolants, 1 QuantifiedInterpolants, 1419 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-24 22:04:59,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51297a4f-9102-4bc2-8d77-db0412e05f5d/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample