./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:48:01,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:48:01,336 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:48:01,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:48:01,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:48:01,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:48:01,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:48:01,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:48:01,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:48:01,372 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:48:01,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:48:01,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:48:01,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:48:01,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:48:01,375 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:48:01,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:48:01,376 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:48:01,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:48:01,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:48:01,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:48:01,378 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:48:01,381 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:48:01,381 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:48:01,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:48:01,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:48:01,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:48:01,383 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:48:01,383 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:48:01,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:48:01,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:48:01,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:48:01,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:48:01,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:48:01,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:48:01,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:48:01,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:48:01,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:48:01,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:48:01,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:48:01,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:48:01,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:48:01,393 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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2023-11-24 21:48:01,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:48:01,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:48:01,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:48:01,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:48:01,674 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:48:01,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-24 21:48:04,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:48:05,257 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:48:05,258 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-24 21:48:05,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data/19b79bcc9/00eb689931af43068e3822f0f5f3374d/FLAGbe52ade3c [2023-11-24 21:48:05,292 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data/19b79bcc9/00eb689931af43068e3822f0f5f3374d [2023-11-24 21:48:05,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:48:05,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:48:05,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:48:05,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:48:05,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:48:05,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:05,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c5c24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05, skipping insertion in model container [2023-11-24 21:48:05,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:05,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:48:05,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:48:05,860 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:48:05,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:48:05,986 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:48:05,986 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:48:05,995 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:48:05,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05 WrapperNode [2023-11-24 21:48:05,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:48:05,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:48:05,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:48:05,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:48:06,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,096 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-24 21:48:06,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:48:06,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:48:06,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:48:06,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:48:06,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,156 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:48:06,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:48:06,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:48:06,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:48:06,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:48:06,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (1/1) ... [2023-11-24 21:48:06,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:48:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:48:06,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:48:06,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:48:06,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:48:06,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:48:06,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:48:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:48:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:48:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:48:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:48:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:48:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:48:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:48:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:48:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:48:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:48:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:48:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:48:06,332 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:48:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:48:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:48:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:48:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:48:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:48:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:48:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:48:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:48:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:48:06,336 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 21:48:06,545 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:48:06,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:48:07,048 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:48:07,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:48:07,416 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:48:07,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:48:07 BoogieIcfgContainer [2023-11-24 21:48:07,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:48:07,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:48:07,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:48:07,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:48:07,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:48:05" (1/3) ... [2023-11-24 21:48:07,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f64cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:48:07, skipping insertion in model container [2023-11-24 21:48:07,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:48:05" (2/3) ... [2023-11-24 21:48:07,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f64cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:48:07, skipping insertion in model container [2023-11-24 21:48:07,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:48:07" (3/3) ... [2023-11-24 21:48:07,425 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-11-24 21:48:07,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:48:07,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:48:07,446 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:48:07,510 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:48:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:48:07,621 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 21:48:07,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:48:07,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-24 21:48:07,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:48:07,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-24 21:48:07,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:48:07,672 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;@20eed750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:48:07,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:48:07,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:48:07,679 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:48:07,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:48:07,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:07,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:48:07,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:07,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 13782, now seen corresponding path program 1 times [2023-11-24 21:48:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469295482] [2023-11-24 21:48:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:08,033 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 21:48:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469295482] [2023-11-24 21:48:08,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469295482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:48:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181134491] [2023-11-24 21:48:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:08,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:08,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:48:08,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 21:48:08,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:08,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:48:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:09,119 INFO L124 PetriNetUnfolderBase]: 1941/3575 cut-off events. [2023-11-24 21:48:09,119 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-24 21:48:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 3575 events. 1941/3575 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28307 event pairs, 1467 based on Foata normal form. 180/3414 useless extension candidates. Maximal degree in co-relation 6383. Up to 2085 conditions per place. [2023-11-24 21:48:09,193 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-24 21:48:09,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 214 flow [2023-11-24 21:48:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:48:09,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-24 21:48:09,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:48:09,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:48:09,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:09,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:48:09,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:09,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:09,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:09,231 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:48:09,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 214 flow [2023-11-24 21:48:09,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:48:09,246 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:48:09,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 21:48:09,252 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 21:48:09,252 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:48:09,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 21:48:09,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:09,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:48:09,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:48:09,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:09,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 13783, now seen corresponding path program 1 times [2023-11-24 21:48:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:09,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948886862] [2023-11-24 21:48:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:09,468 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 21:48:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948886862] [2023-11-24 21:48:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948886862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:09,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:48:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651227372] [2023-11-24 21:48:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:09,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:09,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:09,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-24 21:48:09,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:09,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:09,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-24 21:48:09,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:10,254 INFO L124 PetriNetUnfolderBase]: 1941/3574 cut-off events. [2023-11-24 21:48:10,254 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:48:10,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 3574 events. 1941/3574 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28351 event pairs, 1467 based on Foata normal form. 1/3234 useless extension candidates. Maximal degree in co-relation 6473. Up to 2084 conditions per place. [2023-11-24 21:48:10,295 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-24 21:48:10,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2023-11-24 21:48:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:48:10,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-24 21:48:10,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:48:10,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:48:10,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:10,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:48:10,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:10,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:10,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:10,312 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:48:10,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2023-11-24 21:48:10,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:10,323 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:48:10,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-24 21:48:10,329 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-24 21:48:10,330 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:48:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:10,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:10,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:48:10,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:48:10,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:10,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 411002765, now seen corresponding path program 1 times [2023-11-24 21:48:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085510007] [2023-11-24 21:48:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:10,411 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 21:48:10,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085510007] [2023-11-24 21:48:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085510007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560604480] [2023-11-24 21:48:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:10,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:10,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:10,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:48:10,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 21:48:10,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:10,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:48:10,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:11,182 INFO L124 PetriNetUnfolderBase]: 1942/3572 cut-off events. [2023-11-24 21:48:11,182 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:48:11,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 3572 events. 1942/3572 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28166 event pairs, 1467 based on Foata normal form. 0/3235 useless extension candidates. Maximal degree in co-relation 6474. Up to 2084 conditions per place. [2023-11-24 21:48:11,225 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-24 21:48:11,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 210 flow [2023-11-24 21:48:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:48:11,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:48:11,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:48:11,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:48:11,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:11,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:48:11,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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 21:48:11,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:11,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:11,230 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:48:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 210 flow [2023-11-24 21:48:11,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:11,238 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-24 21:48:11,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-24 21:48:11,240 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-24 21:48:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-24 21:48:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 21:48:11,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:11,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:48:11,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:48:11,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:11,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 411002766, now seen corresponding path program 1 times [2023-11-24 21:48:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991876290] [2023-11-24 21:48:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:48:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991876290] [2023-11-24 21:48:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991876290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:11,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:11,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481507945] [2023-11-24 21:48:11,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:11,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:11,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:11,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-24 21:48:11,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 21:48:11,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:11,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-24 21:48:11,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:12,052 INFO L124 PetriNetUnfolderBase]: 1941/3570 cut-off events. [2023-11-24 21:48:12,052 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-24 21:48:12,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6481 conditions, 3570 events. 1941/3570 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27876 event pairs, 1250 based on Foata normal form. 2/3236 useless extension candidates. Maximal degree in co-relation 6471. Up to 2081 conditions per place. [2023-11-24 21:48:12,091 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:48:12,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 206 flow [2023-11-24 21:48:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:48:12,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-24 21:48:12,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:48:12,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:48:12,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:12,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:48:12,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:12,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:12,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:12,098 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:48:12,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 206 flow [2023-11-24 21:48:12,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:12,106 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-24 21:48:12,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-24 21:48:12,109 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-24 21:48:12,109 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-24 21:48:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 21:48:12,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:12,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:12,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:48:12,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:12,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash -767970052, now seen corresponding path program 1 times [2023-11-24 21:48:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485169208] [2023-11-24 21:48:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:12,223 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 21:48:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485169208] [2023-11-24 21:48:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485169208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:12,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965465630] [2023-11-24 21:48:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:12,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:12,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:48:12,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:12,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:12,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:48:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:13,056 INFO L124 PetriNetUnfolderBase]: 1948/3571 cut-off events. [2023-11-24 21:48:13,056 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-24 21:48:13,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 3571 events. 1948/3571 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28077 event pairs, 970 based on Foata normal form. 0/3247 useless extension candidates. Maximal degree in co-relation 6485. Up to 2082 conditions per place. [2023-11-24 21:48:13,106 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 21:48:13,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 206 flow [2023-11-24 21:48:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:48:13,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:48:13,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:48:13,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:48:13,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:13,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:48:13,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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 21:48:13,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:13,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:13,113 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:48:13,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 206 flow [2023-11-24 21:48:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:13,120 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-24 21:48:13,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 21:48:13,123 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-24 21:48:13,123 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-24 21:48:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:13,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:13,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:13,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:48:13,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:13,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash -767970051, now seen corresponding path program 1 times [2023-11-24 21:48:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072654224] [2023-11-24 21:48:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:13,272 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 21:48:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072654224] [2023-11-24 21:48:13,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072654224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:13,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:13,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058469771] [2023-11-24 21:48:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:13,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:13,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-24 21:48:13,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:13,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:13,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-24 21:48:13,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:13,962 INFO L124 PetriNetUnfolderBase]: 1941/3535 cut-off events. [2023-11-24 21:48:13,962 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-24 21:48:13,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 3535 events. 1941/3535 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27184 event pairs, 1492 based on Foata normal form. 6/3219 useless extension candidates. Maximal degree in co-relation 6440. Up to 2069 conditions per place. [2023-11-24 21:48:13,996 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:48:13,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 202 flow [2023-11-24 21:48:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:48:13,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-24 21:48:13,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:48:13,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:48:13,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:13,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:48:14,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,001 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:48:14,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 202 flow [2023-11-24 21:48:14,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:14,009 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:48:14,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-24 21:48:14,011 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-24 21:48:14,011 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:48:14,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:14,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:14,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:48:14,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:14,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:14,013 INFO L85 PathProgramCache]: Analyzing trace with hash 695392978, now seen corresponding path program 1 times [2023-11-24 21:48:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:14,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082667561] [2023-11-24 21:48:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:14,204 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 21:48:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:14,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082667561] [2023-11-24 21:48:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082667561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:14,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:48:14,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012995058] [2023-11-24 21:48:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:14,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:14,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:14,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:14,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:14,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 66 [2023-11-24 21:48:14,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 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 21:48:14,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:14,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 66 [2023-11-24 21:48:14,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:14,674 INFO L124 PetriNetUnfolderBase]: 1525/2662 cut-off events. [2023-11-24 21:48:14,674 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-24 21:48:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 2662 events. 1525/2662 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19568 event pairs, 277 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 4965. Up to 1717 conditions per place. [2023-11-24 21:48:14,701 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2023-11-24 21:48:14,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 222 flow [2023-11-24 21:48:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2023-11-24 21:48:14,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7828282828282829 [2023-11-24 21:48:14,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2023-11-24 21:48:14,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2023-11-24 21:48:14,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:14,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2023-11-24 21:48:14,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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 21:48:14,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,707 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 155 transitions. [2023-11-24 21:48:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 222 flow [2023-11-24 21:48:14,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:14,710 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 114 flow [2023-11-24 21:48:14,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-24 21:48:14,712 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:48:14,713 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 114 flow [2023-11-24 21:48:14,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 21:48:14,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:14,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:14,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:48:14,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:14,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 695391480, now seen corresponding path program 1 times [2023-11-24 21:48:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902740055] [2023-11-24 21:48:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:14,792 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 21:48:14,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:14,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902740055] [2023-11-24 21:48:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902740055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:14,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092286385] [2023-11-24 21:48:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:14,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:14,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:48:14,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:14,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:14,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:48:14,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:15,248 INFO L124 PetriNetUnfolderBase]: 1385/2534 cut-off events. [2023-11-24 21:48:15,248 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-24 21:48:15,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 2534 events. 1385/2534 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19115 event pairs, 609 based on Foata normal form. 0/2455 useless extension candidates. Maximal degree in co-relation 4715. Up to 1640 conditions per place. [2023-11-24 21:48:15,276 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 29 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 21:48:15,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 192 flow [2023-11-24 21:48:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:48:15,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 21:48:15,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:48:15,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:48:15,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:15,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:48:15,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 21:48:15,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,281 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 114 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:48:15,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 192 flow [2023-11-24 21:48:15,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:15,284 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-24 21:48:15,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 21:48:15,285 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-24 21:48:15,285 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-24 21:48:15,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:15,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:15,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:48:15,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:15,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 695391481, now seen corresponding path program 1 times [2023-11-24 21:48:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269928469] [2023-11-24 21:48:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:15,399 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 21:48:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269928469] [2023-11-24 21:48:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269928469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:48:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559325392] [2023-11-24 21:48:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:15,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:48:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:15,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:48:15,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:48:15,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-24 21:48:15,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 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 21:48:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:15,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-24 21:48:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:15,846 INFO L124 PetriNetUnfolderBase]: 1339/2524 cut-off events. [2023-11-24 21:48:15,846 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:48:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 2524 events. 1339/2524 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19237 event pairs, 417 based on Foata normal form. 24/2469 useless extension candidates. Maximal degree in co-relation 4587. Up to 1570 conditions per place. [2023-11-24 21:48:15,872 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-24 21:48:15,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 186 flow [2023-11-24 21:48:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:48:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:48:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-24 21:48:15,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2023-11-24 21:48:15,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-24 21:48:15,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-24 21:48:15,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:15,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-24 21:48:15,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:15,877 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 145 transitions. [2023-11-24 21:48:15,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 186 flow [2023-11-24 21:48:15,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:15,881 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-24 21:48:15,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-24 21:48:15,883 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-24 21:48:15,883 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-24 21:48:15,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 21:48:15,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:15,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:15,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:48:15,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:15,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1468780422, now seen corresponding path program 1 times [2023-11-24 21:48:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:15,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645041435] [2023-11-24 21:48:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:15,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:16,867 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 21:48:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:16,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645041435] [2023-11-24 21:48:16,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645041435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:48:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718553353] [2023-11-24 21:48:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:16,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:48:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:48:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:48:17,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:48:17,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 21:48:17,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:17,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:48:17,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:17,882 INFO L124 PetriNetUnfolderBase]: 1347/2460 cut-off events. [2023-11-24 21:48:17,883 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-24 21:48:17,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 2460 events. 1347/2460 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18332 event pairs, 244 based on Foata normal form. 72/2454 useless extension candidates. Maximal degree in co-relation 4539. Up to 1570 conditions per place. [2023-11-24 21:48:17,907 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 4 changer transitions 9/66 dead transitions. [2023-11-24 21:48:17,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 228 flow [2023-11-24 21:48:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:48:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:48:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 274 transitions. [2023-11-24 21:48:17,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930735930735931 [2023-11-24 21:48:17,909 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 274 transitions. [2023-11-24 21:48:17,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 274 transitions. [2023-11-24 21:48:17,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:17,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 274 transitions. [2023-11-24 21:48:17,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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 21:48:17,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 21:48:17,913 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 21:48:17,913 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 274 transitions. [2023-11-24 21:48:17,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 228 flow [2023-11-24 21:48:17,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:17,916 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-24 21:48:17,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-24 21:48:17,917 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:48:17,917 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-24 21:48:17,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 21:48:17,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:17,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:17,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:48:17,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:17,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1468781681, now seen corresponding path program 1 times [2023-11-24 21:48:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347730743] [2023-11-24 21:48:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:18,121 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 21:48:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347730743] [2023-11-24 21:48:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347730743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:18,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:18,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:48:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439557250] [2023-11-24 21:48:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:18,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:48:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:48:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:48:18,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:48:18,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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 21:48:18,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:18,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:48:18,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:19,031 INFO L124 PetriNetUnfolderBase]: 2477/4022 cut-off events. [2023-11-24 21:48:19,032 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-24 21:48:19,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 4022 events. 2477/4022 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 29906 event pairs, 413 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 7615. Up to 1831 conditions per place. [2023-11-24 21:48:19,068 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 30 selfloop transitions, 2 changer transitions 44/99 dead transitions. [2023-11-24 21:48:19,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 366 flow [2023-11-24 21:48:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:48:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:48:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 366 transitions. [2023-11-24 21:48:19,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2023-11-24 21:48:19,071 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 366 transitions. [2023-11-24 21:48:19,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 366 transitions. [2023-11-24 21:48:19,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:19,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 366 transitions. [2023-11-24 21:48:19,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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 21:48:19,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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 21:48:19,076 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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 21:48:19,076 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 8 states and 366 transitions. [2023-11-24 21:48:19,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 366 flow [2023-11-24 21:48:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 359 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:48:19,079 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 117 flow [2023-11-24 21:48:19,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=8, PETRI_FLOW=117, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-11-24 21:48:19,080 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 21:48:19,080 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 117 flow [2023-11-24 21:48:19,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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 21:48:19,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:19,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:48:19,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:19,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 386281638, now seen corresponding path program 1 times [2023-11-24 21:48:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:19,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912252647] [2023-11-24 21:48:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:19,342 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 21:48:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912252647] [2023-11-24 21:48:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912252647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:48:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344551174] [2023-11-24 21:48:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:19,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:48:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:48:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:48:19,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 21:48:19,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:19,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:19,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 21:48:19,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:20,452 INFO L124 PetriNetUnfolderBase]: 5293/8033 cut-off events. [2023-11-24 21:48:20,453 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2023-11-24 21:48:20,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16710 conditions, 8033 events. 5293/8033 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54660 event pairs, 663 based on Foata normal form. 240/8229 useless extension candidates. Maximal degree in co-relation 16694. Up to 4461 conditions per place. [2023-11-24 21:48:20,532 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 47 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-24 21:48:20,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 288 flow [2023-11-24 21:48:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:48:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:48:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-24 21:48:20,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-24 21:48:20,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-24 21:48:20,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-24 21:48:20,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:20,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-24 21:48:20,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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 21:48:20,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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 21:48:20,537 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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 21:48:20,537 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 117 flow. Second operand 4 states and 192 transitions. [2023-11-24 21:48:20,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 288 flow [2023-11-24 21:48:20,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 276 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-24 21:48:20,615 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 147 flow [2023-11-24 21:48:20,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-24 21:48:20,616 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-24 21:48:20,616 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 147 flow [2023-11-24 21:48:20,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:20,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:20,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:20,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:48:20,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:20,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1589108294, now seen corresponding path program 1 times [2023-11-24 21:48:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538976343] [2023-11-24 21:48:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:20,829 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 21:48:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538976343] [2023-11-24 21:48:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538976343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:48:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63537037] [2023-11-24 21:48:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:20,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:48:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:48:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:48:20,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 21:48:20,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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 21:48:20,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:20,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 21:48:20,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:21,865 INFO L124 PetriNetUnfolderBase]: 4321/6601 cut-off events. [2023-11-24 21:48:21,866 INFO L125 PetriNetUnfolderBase]: For 1732/1732 co-relation queries the response was YES. [2023-11-24 21:48:21,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15390 conditions, 6601 events. 4321/6601 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43533 event pairs, 249 based on Foata normal form. 228/6793 useless extension candidates. Maximal degree in co-relation 15376. Up to 3201 conditions per place. [2023-11-24 21:48:21,926 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 60 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2023-11-24 21:48:21,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 402 flow [2023-11-24 21:48:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:48:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:48:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-24 21:48:21,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7363636363636363 [2023-11-24 21:48:21,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-24 21:48:21,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-24 21:48:21,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:21,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-24 21:48:21,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 21:48:21,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:21,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:48:21,933 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-24 21:48:21,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 402 flow [2023-11-24 21:48:21,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 391 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-24 21:48:21,938 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 199 flow [2023-11-24 21:48:21,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-24 21:48:21,940 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-24 21:48:21,940 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 199 flow [2023-11-24 21:48:21,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 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 21:48:21,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:21,941 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] [2023-11-24 21:48:21,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:48:21,941 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:21,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1750622039, now seen corresponding path program 1 times [2023-11-24 21:48:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118194337] [2023-11-24 21:48:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:48:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118194337] [2023-11-24 21:48:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118194337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:48:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569113889] [2023-11-24 21:48:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:22,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:48:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:48:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:48:22,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 21:48:22,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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 21:48:22,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:22,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 21:48:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:22,956 INFO L124 PetriNetUnfolderBase]: 2837/4325 cut-off events. [2023-11-24 21:48:22,956 INFO L125 PetriNetUnfolderBase]: For 3458/3458 co-relation queries the response was YES. [2023-11-24 21:48:22,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11370 conditions, 4325 events. 2837/4325 cut-off events. For 3458/3458 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25384 event pairs, 115 based on Foata normal form. 172/4466 useless extension candidates. Maximal degree in co-relation 11354. Up to 1361 conditions per place. [2023-11-24 21:48:22,999 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 71 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2023-11-24 21:48:22,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 526 flow [2023-11-24 21:48:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:48:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:48:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-24 21:48:23,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:48:23,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-24 21:48:23,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-24 21:48:23,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:23,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-24 21:48:23,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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 21:48:23,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:23,006 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:23,006 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-24 21:48:23,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 526 flow [2023-11-24 21:48:23,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-24 21:48:23,023 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 249 flow [2023-11-24 21:48:23,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 21:48:23,024 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 21:48:23,025 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 249 flow [2023-11-24 21:48:23,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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 21:48:23,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:23,025 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 21:48:23,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:48:23,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:23,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1303750266, now seen corresponding path program 1 times [2023-11-24 21:48:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20908223] [2023-11-24 21:48:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:23,351 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 21:48:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20908223] [2023-11-24 21:48:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20908223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:48:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203740354] [2023-11-24 21:48:23,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:23,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:48:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:48:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:48:23,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 21:48:23,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 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 21:48:23,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:23,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 21:48:23,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:24,363 INFO L124 PetriNetUnfolderBase]: 4040/6742 cut-off events. [2023-11-24 21:48:24,364 INFO L125 PetriNetUnfolderBase]: For 3888/4487 co-relation queries the response was YES. [2023-11-24 21:48:24,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15915 conditions, 6742 events. 4040/6742 cut-off events. For 3888/4487 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 45119 event pairs, 1186 based on Foata normal form. 165/6499 useless extension candidates. Maximal degree in co-relation 15898. Up to 2731 conditions per place. [2023-11-24 21:48:24,422 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 54 selfloop transitions, 2 changer transitions 20/110 dead transitions. [2023-11-24 21:48:24,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 535 flow [2023-11-24 21:48:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:48:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:48:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2023-11-24 21:48:24,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7247474747474747 [2023-11-24 21:48:24,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 287 transitions. [2023-11-24 21:48:24,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 287 transitions. [2023-11-24 21:48:24,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:24,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 287 transitions. [2023-11-24 21:48:24,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 21:48:24,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:24,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:24,429 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 249 flow. Second operand 6 states and 287 transitions. [2023-11-24 21:48:24,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 535 flow [2023-11-24 21:48:24,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 488 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-24 21:48:24,464 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 223 flow [2023-11-24 21:48:24,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-11-24 21:48:24,465 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 21:48:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 223 flow [2023-11-24 21:48:24,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 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 21:48:24,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:24,466 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 21:48:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:48:24,467 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:24,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1441701762, now seen corresponding path program 2 times [2023-11-24 21:48:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973521014] [2023-11-24 21:48:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:24,800 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 21:48:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973521014] [2023-11-24 21:48:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973521014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:48:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47308429] [2023-11-24 21:48:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:24,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:48:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:48:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:48:24,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2023-11-24 21:48:24,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 21:48:24,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:24,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2023-11-24 21:48:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:27,830 INFO L124 PetriNetUnfolderBase]: 13757/21894 cut-off events. [2023-11-24 21:48:27,830 INFO L125 PetriNetUnfolderBase]: For 8836/9715 co-relation queries the response was YES. [2023-11-24 21:48:27,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51402 conditions, 21894 events. 13757/21894 cut-off events. For 8836/9715 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 164150 event pairs, 2811 based on Foata normal form. 529/21378 useless extension candidates. Maximal degree in co-relation 51383. Up to 8112 conditions per place. [2023-11-24 21:48:27,975 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 92 selfloop transitions, 16 changer transitions 65/203 dead transitions. [2023-11-24 21:48:27,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 203 transitions, 967 flow [2023-11-24 21:48:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 21:48:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-24 21:48:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 608 transitions. [2023-11-24 21:48:27,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.658008658008658 [2023-11-24 21:48:27,984 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 608 transitions. [2023-11-24 21:48:27,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 608 transitions. [2023-11-24 21:48:27,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:27,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 608 transitions. [2023-11-24 21:48:27,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 43.42857142857143) internal successors, (608), 14 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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 21:48:27,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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 21:48:27,990 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states 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 21:48:27,991 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 223 flow. Second operand 14 states and 608 transitions. [2023-11-24 21:48:27,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 203 transitions, 967 flow [2023-11-24 21:48:28,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 942 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-24 21:48:28,203 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 370 flow [2023-11-24 21:48:28,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=370, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2023-11-24 21:48:28,204 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2023-11-24 21:48:28,205 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 370 flow [2023-11-24 21:48:28,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 21:48:28,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:28,206 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 21:48:28,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:48:28,206 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:28,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1311430866, now seen corresponding path program 1 times [2023-11-24 21:48:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735385230] [2023-11-24 21:48:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:28,663 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 21:48:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735385230] [2023-11-24 21:48:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735385230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:28,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:48:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18054373] [2023-11-24 21:48:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:28,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:48:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:48:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:48:28,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 21:48:28,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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 21:48:28,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:28,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 21:48:28,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:32,439 INFO L124 PetriNetUnfolderBase]: 16746/26993 cut-off events. [2023-11-24 21:48:32,439 INFO L125 PetriNetUnfolderBase]: For 40109/41159 co-relation queries the response was YES. [2023-11-24 21:48:32,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78035 conditions, 26993 events. 16746/26993 cut-off events. For 40109/41159 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 214535 event pairs, 5889 based on Foata normal form. 675/26253 useless extension candidates. Maximal degree in co-relation 78004. Up to 11433 conditions per place. [2023-11-24 21:48:32,747 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 59 selfloop transitions, 12 changer transitions 25/128 dead transitions. [2023-11-24 21:48:32,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 837 flow [2023-11-24 21:48:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:48:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:48:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 270 transitions. [2023-11-24 21:48:32,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-24 21:48:32,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 270 transitions. [2023-11-24 21:48:32,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 270 transitions. [2023-11-24 21:48:32,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:32,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 270 transitions. [2023-11-24 21:48:32,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:48:32,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:32,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 21:48:32,762 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 370 flow. Second operand 6 states and 270 transitions. [2023-11-24 21:48:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 128 transitions, 837 flow [2023-11-24 21:48:33,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 807 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-24 21:48:33,259 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 431 flow [2023-11-24 21:48:33,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2023-11-24 21:48:33,260 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-24 21:48:33,261 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 431 flow [2023-11-24 21:48:33,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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 21:48:33,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:33,261 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 21:48:33,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:48:33,262 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:33,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2087282102, now seen corresponding path program 3 times [2023-11-24 21:48:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:33,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215501182] [2023-11-24 21:48:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:33,540 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 21:48:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215501182] [2023-11-24 21:48:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215501182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:48:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967507054] [2023-11-24 21:48:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:33,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:48:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:48:33,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:48:33,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 21:48:33,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 21:48:33,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:33,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 21:48:33,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:35,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][77], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, 47#L784true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), 239#(= ~z~0 1), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 48#L809true, 264#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 173#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:35,339 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,339 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,339 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,339 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][77], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 47#L784true, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, 264#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 62#P2EXITtrue, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 173#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:35,428 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:35,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:48:36,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 239#(= ~z~0 1), P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 19#L789true, 48#L809true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:36,035 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,035 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,035 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,035 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, 19#L789true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, 62#P2EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:36,179 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,179 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,180 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,180 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:48:36,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 239#(= ~z~0 1), P3Thread1of1ForFork1InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork3InUse, 181#(= ~x~0 1), Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 48#L809true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 8#P0EXITtrue, Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 43#P1EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 13#L839true, Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:36,496 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_104 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse4))) (and (= v_~y$r_buff0_thd4~0_27 (ite .cse0 0 v_~y$r_buff0_thd4~0_28)) (= (ite .cse1 v_~y$w_buff0~0_46 (ite .cse2 v_~y$w_buff1~0_43 v_~y~0_65)) v_~y~0_64) (= (ite .cse1 0 v_~y$w_buff0_used~0_104) v_~y$w_buff0_used~0_103) (= v_~y$w_buff1_used~0_96 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_97)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_43, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 181#(= ~x~0 1), P0Thread1of1ForFork2InUse, 186#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), P1Thread1of1ForFork0InUse, Black: 128#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork1InUse, 237#true, P2Thread1of1ForFork3InUse, Black: 148#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L756true, Black: 210#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 160#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 200#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 198#(= ~a~0 1), Black: 196#true, 53#L864true, 62#P2EXITtrue, 266#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 204#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 43#P1EXITtrue, 175#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 123#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t696~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), Black: 240#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 13#L839true, 206#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 244#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 239#(= ~z~0 1), Black: 246#(and (= ~z~0 1) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:48:36,590 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,590 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,590 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:36,590 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:48:37,536 INFO L124 PetriNetUnfolderBase]: 18992/27565 cut-off events. [2023-11-24 21:48:37,537 INFO L125 PetriNetUnfolderBase]: For 37440/41737 co-relation queries the response was YES. [2023-11-24 21:48:37,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79648 conditions, 27565 events. 18992/27565 cut-off events. For 37440/41737 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 190626 event pairs, 952 based on Foata normal form. 1132/27689 useless extension candidates. Maximal degree in co-relation 79617. Up to 9055 conditions per place. [2023-11-24 21:48:37,705 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 56 selfloop transitions, 18 changer transitions 23/127 dead transitions. [2023-11-24 21:48:37,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 127 transitions, 783 flow [2023-11-24 21:48:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:48:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:48:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2023-11-24 21:48:37,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6991341991341992 [2023-11-24 21:48:37,709 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 323 transitions. [2023-11-24 21:48:37,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 323 transitions. [2023-11-24 21:48:37,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:37,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 323 transitions. [2023-11-24 21:48:37,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states 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 21:48:37,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 21:48:37,713 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 21:48:37,713 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 431 flow. Second operand 7 states and 323 transitions. [2023-11-24 21:48:37,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 127 transitions, 783 flow [2023-11-24 21:48:38,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 127 transitions, 763 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-24 21:48:38,602 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 402 flow [2023-11-24 21:48:38,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2023-11-24 21:48:38,603 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places. [2023-11-24 21:48:38,603 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 402 flow [2023-11-24 21:48:38,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 21:48:38,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:38,604 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, 1, 1, 1, 1, 1] [2023-11-24 21:48:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:48:38,604 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:38,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1918582455, now seen corresponding path program 1 times [2023-11-24 21:48:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807039308] [2023-11-24 21:48:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:48:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807039308] [2023-11-24 21:48:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807039308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:48:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61084983] [2023-11-24 21:48:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:48:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:48:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:48:39,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 21:48:39,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 69 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 21:48:39,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:39,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 21:48:39,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:42,086 INFO L124 PetriNetUnfolderBase]: 7686/13021 cut-off events. [2023-11-24 21:48:42,086 INFO L125 PetriNetUnfolderBase]: For 22150/22585 co-relation queries the response was YES. [2023-11-24 21:48:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38614 conditions, 13021 events. 7686/13021 cut-off events. For 22150/22585 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 102333 event pairs, 2150 based on Foata normal form. 90/12265 useless extension candidates. Maximal degree in co-relation 38582. Up to 4293 conditions per place. [2023-11-24 21:48:42,212 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 60 selfloop transitions, 16 changer transitions 38/146 dead transitions. [2023-11-24 21:48:42,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 146 transitions, 986 flow [2023-11-24 21:48:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:48:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:48:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 418 transitions. [2023-11-24 21:48:42,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-11-24 21:48:42,215 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 418 transitions. [2023-11-24 21:48:42,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 418 transitions. [2023-11-24 21:48:42,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:42,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 418 transitions. [2023-11-24 21:48:42,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 41.8) internal successors, (418), 10 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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 21:48:42,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 21:48:42,220 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 21:48:42,220 INFO L175 Difference]: Start difference. First operand has 92 places, 69 transitions, 402 flow. Second operand 10 states and 418 transitions. [2023-11-24 21:48:42,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 146 transitions, 986 flow [2023-11-24 21:48:42,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 805 flow, removed 42 selfloop flow, removed 15 redundant places. [2023-11-24 21:48:42,520 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 371 flow [2023-11-24 21:48:42,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2023-11-24 21:48:42,521 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places. [2023-11-24 21:48:42,521 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 371 flow [2023-11-24 21:48:42,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.875) internal successors, (279), 8 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 21:48:42,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:42,522 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, 1, 1, 1, 1, 1] [2023-11-24 21:48:42,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:48:42,522 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:42,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1369432017, now seen corresponding path program 2 times [2023-11-24 21:48:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708828605] [2023-11-24 21:48:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:48:43,628 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 21:48:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:48:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708828605] [2023-11-24 21:48:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708828605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:48:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:48:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:48:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559470138] [2023-11-24 21:48:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:48:43,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:48:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:48:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:48:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:48:43,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:48:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 21:48:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:48:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:48:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:48:44,935 INFO L124 PetriNetUnfolderBase]: 5413/9438 cut-off events. [2023-11-24 21:48:44,935 INFO L125 PetriNetUnfolderBase]: For 4107/4392 co-relation queries the response was YES. [2023-11-24 21:48:45,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21660 conditions, 9438 events. 5413/9438 cut-off events. For 4107/4392 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 72995 event pairs, 1894 based on Foata normal form. 72/8511 useless extension candidates. Maximal degree in co-relation 21632. Up to 3290 conditions per place. [2023-11-24 21:48:45,022 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 28 selfloop transitions, 5 changer transitions 46/118 dead transitions. [2023-11-24 21:48:45,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 640 flow [2023-11-24 21:48:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:48:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:48:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 398 transitions. [2023-11-24 21:48:45,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.67003367003367 [2023-11-24 21:48:45,025 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 398 transitions. [2023-11-24 21:48:45,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 398 transitions. [2023-11-24 21:48:45,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:48:45,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 398 transitions. [2023-11-24 21:48:45,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 21:48:45,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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 21:48:45,033 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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 21:48:45,033 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 371 flow. Second operand 9 states and 398 transitions. [2023-11-24 21:48:45,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 640 flow [2023-11-24 21:48:45,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 118 transitions, 626 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-24 21:48:45,045 INFO L231 Difference]: Finished difference. Result has 98 places, 65 transitions, 282 flow [2023-11-24 21:48:45,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=98, PETRI_TRANSITIONS=65} [2023-11-24 21:48:45,046 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 25 predicate places. [2023-11-24 21:48:45,046 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 65 transitions, 282 flow [2023-11-24 21:48:45,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 21:48:45,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:48:45,047 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, 1, 1, 1, 1, 1] [2023-11-24 21:48:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:48:45,048 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:48:45,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:48:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 462805981, now seen corresponding path program 3 times [2023-11-24 21:48:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:48:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459811654] [2023-11-24 21:48:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:48:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:48:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:48:45,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:48:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:48:45,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:48:45,248 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:48:45,249 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-24 21:48:45,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-24 21:48:45,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-24 21:48:45,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-24 21:48:45,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-24 21:48:45,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-24 21:48:45,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-24 21:48:45,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-24 21:48:45,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-24 21:48:45,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-24 21:48:45,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-24 21:48:45,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-24 21:48:45,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-24 21:48:45,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-24 21:48:45,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-24 21:48:45,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-24 21:48:45,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 21:48:45,254 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:48:45,262 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:48:45,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:48:45,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:48:45,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:48:45,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:48:45,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-24 21:48:45,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:48:45,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:48:45,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:48:45 BasicIcfg [2023-11-24 21:48:45,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:48:45,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:48:45,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:48:45,420 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:48:45,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:48:07" (3/4) ... [2023-11-24 21:48:45,422 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:48:45,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:48:45,424 INFO L158 Benchmark]: Toolchain (without parser) took 40118.66ms. Allocated memory was 134.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 103.7MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-24 21:48:45,424 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 63.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:48:45,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.41ms. Allocated memory is still 134.2MB. Free memory was 103.5MB in the beginning and 79.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-24 21:48:45,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.34ms. Allocated memory is still 134.2MB. Free memory was 79.8MB in the beginning and 77.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:48:45,425 INFO L158 Benchmark]: Boogie Preprocessor took 117.44ms. Allocated memory is still 134.2MB. Free memory was 77.1MB in the beginning and 73.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:48:45,426 INFO L158 Benchmark]: RCFGBuilder took 1197.44ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 77.5MB in the end (delta: -4.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-11-24 21:48:45,426 INFO L158 Benchmark]: TraceAbstraction took 38000.44ms. Allocated memory was 134.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 76.7MB in the beginning and 5.1GB in the end (delta: -5.1GB). Peak memory consumption was 982.8MB. Max. memory is 16.1GB. [2023-11-24 21:48:45,426 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 6.2GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:48:45,428 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.27ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 63.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.41ms. Allocated memory is still 134.2MB. Free memory was 103.5MB in the beginning and 79.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.34ms. Allocated memory is still 134.2MB. Free memory was 79.8MB in the beginning and 77.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.44ms. Allocated memory is still 134.2MB. Free memory was 77.1MB in the beginning and 73.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1197.44ms. Allocated memory is still 134.2MB. Free memory was 73.5MB in the beginning and 77.5MB in the end (delta: -4.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38000.44ms. Allocated memory was 134.2MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 76.7MB in the beginning and 5.1GB in the end (delta: -5.1GB). Peak memory consumption was 982.8MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 6.2GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L878] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L17] 0 __assert_fail ("0", "mix026_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 859]: 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: 863]: 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: 861]: 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 9 procedures, 99 locations, 16 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: 37.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1201 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1036 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2814 IncrementalHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 71 mSDtfsCounter, 2814 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=17, InterpolantAutomatonStates: 109, 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.0s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 2546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 21:48:45,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:48:48,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:48:48,408 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:48:48,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:48:48,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:48:48,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:48:48,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:48:48,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:48:48,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:48:48,476 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:48:48,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:48:48,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:48:48,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:48:48,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:48:48,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:48:48,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:48:48,481 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:48:48,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:48:48,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:48:48,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:48:48,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:48:48,484 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:48:48,485 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:48:48,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:48:48,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:48:48,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:48:48,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:48:48,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:48:48,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:48:48,488 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:48:48,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:48:48,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:48:48,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:48:48,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:48:48,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:48:48,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:48:48,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:48:48,493 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:48:48,493 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:48:48,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:48:48,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:48:48,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:48:48,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:48:48,494 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:48:48,495 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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2023-11-24 21:48:48,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:48:48,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:48:48,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:48:48,968 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:48:48,968 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:48:48,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3ae54bc-b6fd-4780-87ab-d56d7f3c52dd/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i