./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 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_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx --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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:23:35,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:23:35,466 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:23:35,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:23:35,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:23:35,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:23:35,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:23:35,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:23:35,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:23:35,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:23:35,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:23:35,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:23:35,533 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:23:35,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:23:35,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:23:35,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:23:35,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:23:35,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:23:35,538 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:23:35,539 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:23:35,540 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:23:35,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:23:35,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:23:35,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:23:35,542 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:23:35,544 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:23:35,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:23:35,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:23:35,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:23:35,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:23:35,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:23:35,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:23:35,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:23:35,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:23:35,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:23:35,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:23:35,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:23:35,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:23:35,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:23:35,551 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_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/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_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2023-11-21 22:23:35,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:23:35,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:23:35,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:23:35,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:23:35,954 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:23:35,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2023-11-21 22:23:39,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:23:39,419 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:23:39,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2023-11-21 22:23:39,438 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/data/ec8fc91dd/f393ac1093c9466d8b5d055042b3330b/FLAG8fd59077a [2023-11-21 22:23:39,456 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/data/ec8fc91dd/f393ac1093c9466d8b5d055042b3330b [2023-11-21 22:23:39,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:23:39,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:23:39,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:39,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:23:39,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:23:39,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:39" (1/1) ... [2023-11-21 22:23:39,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ce480c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:39, skipping insertion in model container [2023-11-21 22:23:39,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:39" (1/1) ... [2023-11-21 22:23:39,553 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:23:40,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:40,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:23:40,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:40,295 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:23:40,295 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:23:40,303 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:23:40,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40 WrapperNode [2023-11-21 22:23:40,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:40,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:40,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:23:40,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:23:40,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,407 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-11-21 22:23:40,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:40,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:23:40,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:23:40,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:23:40,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:23:40,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:23:40,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:23:40,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:23:40,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (1/1) ... [2023-11-21 22:23:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:23:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:40,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:40,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:23:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:23:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:23:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:23:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:23:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:23:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:23:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:23:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:23:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:23:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:23:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:23:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:23:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:23:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:23:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:23:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:23:40,589 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:23:40,760 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:23:40,762 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:23:41,424 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:23:42,210 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:23:42,210 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:23:42,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:42 BoogieIcfgContainer [2023-11-21 22:23:42,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:23:42,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:23:42,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:23:42,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:23:42,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:23:39" (1/3) ... [2023-11-21 22:23:42,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a52095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:42, skipping insertion in model container [2023-11-21 22:23:42,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:40" (2/3) ... [2023-11-21 22:23:42,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a52095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:23:42, skipping insertion in model container [2023-11-21 22:23:42,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:42" (3/3) ... [2023-11-21 22:23:42,226 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-11-21 22:23:42,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:23:42,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-21 22:23:42,250 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:23:42,399 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:23:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2023-11-21 22:23:42,527 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2023-11-21 22:23:42,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:23:42,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 247 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-21 22:23:42,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2023-11-21 22:23:42,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2023-11-21 22:23:42,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:23:42,615 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;@6b681e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:23:42,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-21 22:23:42,619 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:23:42,619 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:23:42,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:23:42,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:42,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:23:42,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:42,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:42,627 INFO L85 PathProgramCache]: Analyzing trace with hash 24600, now seen corresponding path program 1 times [2023-11-21 22:23:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333691696] [2023-11-21 22:23:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333691696] [2023-11-21 22:23:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333691696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:42,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378302300] [2023-11-21 22:23:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:42,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:43,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-21 22:23:43,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:43,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:43,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-21 22:23:43,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:44,705 INFO L124 PetriNetUnfolderBase]: 2900/4797 cut-off events. [2023-11-21 22:23:44,705 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-21 22:23:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9116 conditions, 4797 events. 2900/4797 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 37493 event pairs, 2506 based on Foata normal form. 180/3028 useless extension candidates. Maximal degree in co-relation 9102. Up to 3708 conditions per place. [2023-11-21 22:23:44,769 INFO L140 encePairwiseOnDemand]: 60/79 looper letters, 45 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-21 22:23:44,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 245 flow [2023-11-21 22:23:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2023-11-21 22:23:44,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6708860759493671 [2023-11-21 22:23:44,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 159 transitions. [2023-11-21 22:23:44,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 159 transitions. [2023-11-21 22:23:44,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:44,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 159 transitions. [2023-11-21 22:23:44,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:44,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:44,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:44,842 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 159 transitions. [2023-11-21 22:23:44,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 245 flow [2023-11-21 22:23:44,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:23:44,855 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-21 22:23:44,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, 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=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-21 22:23:44,862 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -17 predicate places. [2023-11-21 22:23:44,863 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-21 22:23:44,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:44,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:44,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:23:44,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:23:44,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:44,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash 24601, now seen corresponding path program 1 times [2023-11-21 22:23:44,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581285636] [2023-11-21 22:23:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:45,049 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-21 22:23:45,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581285636] [2023-11-21 22:23:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581285636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638579332] [2023-11-21 22:23:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:45,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:45,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:45,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:45,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:45,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:45,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:45,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:46,307 INFO L124 PetriNetUnfolderBase]: 2900/4796 cut-off events. [2023-11-21 22:23:46,307 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-21 22:23:46,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9203 conditions, 4796 events. 2900/4796 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 37465 event pairs, 2506 based on Foata normal form. 1/2848 useless extension candidates. Maximal degree in co-relation 9192. Up to 3707 conditions per place. [2023-11-21 22:23:46,367 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-21 22:23:46,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 242 flow [2023-11-21 22:23:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-21 22:23:46,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5527426160337553 [2023-11-21 22:23:46,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-21 22:23:46,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-21 22:23:46,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:46,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-21 22:23:46,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:46,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:46,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:46,379 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 131 transitions. [2023-11-21 22:23:46,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 242 flow [2023-11-21 22:23:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:46,392 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2023-11-21 22:23:46,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, 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=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-21 22:23:46,393 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-11-21 22:23:46,394 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2023-11-21 22:23:46,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:46,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:46,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:23:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:23:46,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:46,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 733658671, now seen corresponding path program 1 times [2023-11-21 22:23:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92843674] [2023-11-21 22:23:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:46,564 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-21 22:23:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92843674] [2023-11-21 22:23:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92843674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656014525] [2023-11-21 22:23:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:46,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:23:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:46,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:46,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-21 22:23:46,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:46,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:46,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:47,607 INFO L124 PetriNetUnfolderBase]: 1741/3111 cut-off events. [2023-11-21 22:23:47,607 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-21 22:23:47,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 3111 events. 1741/3111 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 24548 event pairs, 1311 based on Foata normal form. 0/2189 useless extension candidates. Maximal degree in co-relation 5844. Up to 1911 conditions per place. [2023-11-21 22:23:47,639 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 49 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2023-11-21 22:23:47,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 268 flow [2023-11-21 22:23:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:23:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2023-11-21 22:23:47,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5474683544303798 [2023-11-21 22:23:47,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 173 transitions. [2023-11-21 22:23:47,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 173 transitions. [2023-11-21 22:23:47,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:47,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 173 transitions. [2023-11-21 22:23:47,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:47,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:47,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:47,648 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 4 states and 173 transitions. [2023-11-21 22:23:47,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 268 flow [2023-11-21 22:23:47,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:47,655 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 152 flow [2023-11-21 22:23:47,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-21 22:23:47,658 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2023-11-21 22:23:47,658 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 152 flow [2023-11-21 22:23:47,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-21 22:23:47,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:47,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:23:47,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:23:47,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:47,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 733658672, now seen corresponding path program 1 times [2023-11-21 22:23:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673202331] [2023-11-21 22:23:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:47,844 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-21 22:23:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673202331] [2023-11-21 22:23:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673202331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:47,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366092844] [2023-11-21 22:23:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:47,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:23:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:47,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:47,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:47,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-21 22:23:47,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 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-21 22:23:47,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:47,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-21 22:23:47,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:48,384 INFO L124 PetriNetUnfolderBase]: 806/1552 cut-off events. [2023-11-21 22:23:48,385 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2023-11-21 22:23:48,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 1552 events. 806/1552 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11784 event pairs, 590 based on Foata normal form. 210/1561 useless extension candidates. Maximal degree in co-relation 3278. Up to 809 conditions per place. [2023-11-21 22:23:48,400 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-21 22:23:48,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 230 flow [2023-11-21 22:23:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:23:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2023-11-21 22:23:48,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2023-11-21 22:23:48,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 157 transitions. [2023-11-21 22:23:48,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 157 transitions. [2023-11-21 22:23:48,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:48,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 157 transitions. [2023-11-21 22:23:48,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:48,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:48,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:48,408 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 152 flow. Second operand 4 states and 157 transitions. [2023-11-21 22:23:48,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 230 flow [2023-11-21 22:23:48,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:23:48,415 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 144 flow [2023-11-21 22:23:48,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=4, PETRI_FLOW=144, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2023-11-21 22:23:48,418 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-11-21 22:23:48,418 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 144 flow [2023-11-21 22:23:48,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 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-21 22:23:48,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:48,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:23:48,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:23:48,419 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:48,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 733657348, now seen corresponding path program 1 times [2023-11-21 22:23:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727544198] [2023-11-21 22:23:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:48,502 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-21 22:23:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727544198] [2023-11-21 22:23:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727544198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:48,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:48,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79445361] [2023-11-21 22:23:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:48,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:48,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-21 22:23:48,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:48,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:48,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-21 22:23:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:49,019 INFO L124 PetriNetUnfolderBase]: 808/1551 cut-off events. [2023-11-21 22:23:49,020 INFO L125 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2023-11-21 22:23:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1551 events. 808/1551 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11865 event pairs, 444 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 3313. Up to 810 conditions per place. [2023-11-21 22:23:49,035 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-21 22:23:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 232 flow [2023-11-21 22:23:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-21 22:23:49,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-11-21 22:23:49,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-21 22:23:49,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-21 22:23:49,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:49,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-21 22:23:49,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-21 22:23:49,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,049 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 144 flow. Second operand 3 states and 116 transitions. [2023-11-21 22:23:49,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 232 flow [2023-11-21 22:23:49,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:49,055 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 143 flow [2023-11-21 22:23:49,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-21 22:23:49,058 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2023-11-21 22:23:49,058 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 143 flow [2023-11-21 22:23:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:49,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:23:49,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:23:49,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:49,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 733657349, now seen corresponding path program 1 times [2023-11-21 22:23:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754346033] [2023-11-21 22:23:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:49,190 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-21 22:23:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754346033] [2023-11-21 22:23:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754346033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524088715] [2023-11-21 22:23:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:49,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:49,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:49,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:49,687 INFO L124 PetriNetUnfolderBase]: 806/1546 cut-off events. [2023-11-21 22:23:49,688 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-11-21 22:23:49,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1546 events. 806/1546 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11747 event pairs, 444 based on Foata normal form. 3/1355 useless extension candidates. Maximal degree in co-relation 3335. Up to 805 conditions per place. [2023-11-21 22:23:49,704 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-21 22:23:49,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 229 flow [2023-11-21 22:23:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-21 22:23:49,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978902953586498 [2023-11-21 22:23:49,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-21 22:23:49,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-21 22:23:49,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:49,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-21 22:23:49,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-21 22:23:49,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,710 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 143 flow. Second operand 3 states and 118 transitions. [2023-11-21 22:23:49,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 229 flow [2023-11-21 22:23:49,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:49,715 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 141 flow [2023-11-21 22:23:49,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=141, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-21 22:23:49,719 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2023-11-21 22:23:49,720 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 141 flow [2023-11-21 22:23:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:49,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:23:49,721 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:49,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -701712976, now seen corresponding path program 1 times [2023-11-21 22:23:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081161211] [2023-11-21 22:23:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:49,814 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-21 22:23:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081161211] [2023-11-21 22:23:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081161211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654763765] [2023-11-21 22:23:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:49,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:49,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-21 22:23:49,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:49,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:49,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-21 22:23:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:50,403 INFO L124 PetriNetUnfolderBase]: 813/1544 cut-off events. [2023-11-21 22:23:50,404 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-11-21 22:23:50,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1544 events. 813/1544 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11698 event pairs, 450 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3348. Up to 803 conditions per place. [2023-11-21 22:23:50,419 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-21 22:23:50,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 229 flow [2023-11-21 22:23:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-21 22:23:50,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-11-21 22:23:50,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-21 22:23:50,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-21 22:23:50,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:50,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-21 22:23:50,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-21 22:23:50,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:50,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:50,424 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 141 flow. Second operand 3 states and 116 transitions. [2023-11-21 22:23:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 229 flow [2023-11-21 22:23:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:50,427 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 139 flow [2023-11-21 22:23:50,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=139, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-21 22:23:50,429 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2023-11-21 22:23:50,429 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 139 flow [2023-11-21 22:23:50,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:50,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:50,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:23:50,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:50,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash -701712975, now seen corresponding path program 1 times [2023-11-21 22:23:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:50,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281669712] [2023-11-21 22:23:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:50,519 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-21 22:23:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281669712] [2023-11-21 22:23:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281669712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:50,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:23:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824840577] [2023-11-21 22:23:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:50,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:50,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:50,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:50,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:50,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:51,032 INFO L124 PetriNetUnfolderBase]: 806/1531 cut-off events. [2023-11-21 22:23:51,032 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-11-21 22:23:51,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 1531 events. 806/1531 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11544 event pairs, 447 based on Foata normal form. 6/1357 useless extension candidates. Maximal degree in co-relation 3323. Up to 790 conditions per place. [2023-11-21 22:23:51,046 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-21 22:23:51,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 225 flow [2023-11-21 22:23:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-21 22:23:51,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978902953586498 [2023-11-21 22:23:51,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-21 22:23:51,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-21 22:23:51,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:51,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-21 22:23:51,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-21 22:23:51,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,051 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 139 flow. Second operand 3 states and 118 transitions. [2023-11-21 22:23:51,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 225 flow [2023-11-21 22:23:51,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:51,054 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 137 flow [2023-11-21 22:23:51,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-21 22:23:51,055 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-21 22:23:51,055 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 137 flow [2023-11-21 22:23:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:51,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:51,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:23:51,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:51,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash -503961150, now seen corresponding path program 1 times [2023-11-21 22:23:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944821765] [2023-11-21 22:23:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:51,194 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-21 22:23:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944821765] [2023-11-21 22:23:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944821765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180788960] [2023-11-21 22:23:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:51,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:51,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:51,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-21 22:23:51,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:51,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-21 22:23:51,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:51,564 INFO L124 PetriNetUnfolderBase]: 649/1227 cut-off events. [2023-11-21 22:23:51,564 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-11-21 22:23:51,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1227 events. 649/1227 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8513 event pairs, 118 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2726. Up to 850 conditions per place. [2023-11-21 22:23:51,575 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 40 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-21 22:23:51,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 265 flow [2023-11-21 22:23:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-21 22:23:51,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2023-11-21 22:23:51,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-21 22:23:51,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-21 22:23:51,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:51,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-21 22:23:51,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,581 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 137 flow. Second operand 3 states and 127 transitions. [2023-11-21 22:23:51,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 265 flow [2023-11-21 22:23:51,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:51,584 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 135 flow [2023-11-21 22:23:51,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-21 22:23:51,585 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-11-21 22:23:51,585 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 135 flow [2023-11-21 22:23:51,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:51,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:51,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:23:51,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:51,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 928460070, now seen corresponding path program 1 times [2023-11-21 22:23:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665277537] [2023-11-21 22:23:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:51,699 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-21 22:23:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:51,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665277537] [2023-11-21 22:23:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665277537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:23:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885927256] [2023-11-21 22:23:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:51,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:23:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:51,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-21 22:23:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:51,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:51,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-21 22:23:51,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:52,054 INFO L124 PetriNetUnfolderBase]: 613/1330 cut-off events. [2023-11-21 22:23:52,054 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2023-11-21 22:23:52,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 1330 events. 613/1330 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10275 event pairs, 193 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 2801. Up to 721 conditions per place. [2023-11-21 22:23:52,065 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 43 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-11-21 22:23:52,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 289 flow [2023-11-21 22:23:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:23:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-21 22:23:52,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5569620253164557 [2023-11-21 22:23:52,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-21 22:23:52,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-21 22:23:52,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:52,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-21 22:23:52,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,070 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 135 flow. Second operand 3 states and 132 transitions. [2023-11-21 22:23:52,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 289 flow [2023-11-21 22:23:52,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:52,072 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 144 flow [2023-11-21 22:23:52,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-11-21 22:23:52,073 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-21 22:23:52,074 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 144 flow [2023-11-21 22:23:52,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:52,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:52,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:23:52,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:52,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1103001067, now seen corresponding path program 1 times [2023-11-21 22:23:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075895016] [2023-11-21 22:23:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:52,183 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-21 22:23:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075895016] [2023-11-21 22:23:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075895016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:23:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129637686] [2023-11-21 22:23:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:23:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:52,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-21 22:23:52,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:52,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-21 22:23:52,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:52,649 INFO L124 PetriNetUnfolderBase]: 601/1326 cut-off events. [2023-11-21 22:23:52,650 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-21 22:23:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1326 events. 601/1326 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10259 event pairs, 121 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 2911. Up to 548 conditions per place. [2023-11-21 22:23:52,660 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 42 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-11-21 22:23:52,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 290 flow [2023-11-21 22:23:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:23:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2023-11-21 22:23:52,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221518987341772 [2023-11-21 22:23:52,662 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 165 transitions. [2023-11-21 22:23:52,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 165 transitions. [2023-11-21 22:23:52,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:52,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 165 transitions. [2023-11-21 22:23:52,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,665 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,665 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 144 flow. Second operand 4 states and 165 transitions. [2023-11-21 22:23:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 290 flow [2023-11-21 22:23:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:52,668 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 152 flow [2023-11-21 22:23:52,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-11-21 22:23:52,669 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-21 22:23:52,669 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 152 flow [2023-11-21 22:23:52,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:52,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:52,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:23:52,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:52,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash -851451570, now seen corresponding path program 1 times [2023-11-21 22:23:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162769868] [2023-11-21 22:23:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162769868] [2023-11-21 22:23:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162769868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:23:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467937360] [2023-11-21 22:23:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:23:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:52,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:52,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:23:52,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-21 22:23:52,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:52,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:52,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-21 22:23:52,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:53,370 INFO L124 PetriNetUnfolderBase]: 573/1282 cut-off events. [2023-11-21 22:23:53,371 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2023-11-21 22:23:53,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1282 events. 573/1282 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9924 event pairs, 193 based on Foata normal form. 16/1265 useless extension candidates. Maximal degree in co-relation 2843. Up to 664 conditions per place. [2023-11-21 22:23:53,382 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 41 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-11-21 22:23:53,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 292 flow [2023-11-21 22:23:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:23:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-11-21 22:23:53,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-21 22:23:53,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 158 transitions. [2023-11-21 22:23:53,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 158 transitions. [2023-11-21 22:23:53,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:53,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 158 transitions. [2023-11-21 22:23:53,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:53,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:53,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:53,388 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 152 flow. Second operand 4 states and 158 transitions. [2023-11-21 22:23:53,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 292 flow [2023-11-21 22:23:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:53,391 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 146 flow [2023-11-21 22:23:53,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-11-21 22:23:53,392 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-21 22:23:53,393 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 146 flow [2023-11-21 22:23:53,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:53,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:53,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:53,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:23:53,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:53,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash 831108348, now seen corresponding path program 1 times [2023-11-21 22:23:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939699235] [2023-11-21 22:23:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:53,984 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-21 22:23:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939699235] [2023-11-21 22:23:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939699235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:23:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714416293] [2023-11-21 22:23:53,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:53,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 22:23:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 22:23:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:23:54,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:23:54,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 146 flow. Second operand has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:54,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:23:54,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:54,587 INFO L124 PetriNetUnfolderBase]: 575/1142 cut-off events. [2023-11-21 22:23:54,587 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2023-11-21 22:23:54,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 1142 events. 575/1142 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8257 event pairs, 264 based on Foata normal form. 0/1098 useless extension candidates. Maximal degree in co-relation 2687. Up to 485 conditions per place. [2023-11-21 22:23:54,598 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 32 selfloop transitions, 5 changer transitions 2/56 dead transitions. [2023-11-21 22:23:54,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 264 flow [2023-11-21 22:23:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:23:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:23:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2023-11-21 22:23:54,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39451476793248946 [2023-11-21 22:23:54,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 187 transitions. [2023-11-21 22:23:54,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 187 transitions. [2023-11-21 22:23:54,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:54,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 187 transitions. [2023-11-21 22:23:54,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,606 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,606 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 146 flow. Second operand 6 states and 187 transitions. [2023-11-21 22:23:54,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 264 flow [2023-11-21 22:23:54,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:54,610 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 150 flow [2023-11-21 22:23:54,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-11-21 22:23:54,612 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2023-11-21 22:23:54,612 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 150 flow [2023-11-21 22:23:54,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.875) internal successors, (215), 8 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:54,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:54,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:23:54,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:54,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash 831107717, now seen corresponding path program 1 times [2023-11-21 22:23:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683161209] [2023-11-21 22:23:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:54,900 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-21 22:23:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683161209] [2023-11-21 22:23:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683161209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730471533] [2023-11-21 22:23:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:54,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:23:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:23:54,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-21 22:23:54,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:54,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:54,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-21 22:23:54,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:55,574 INFO L124 PetriNetUnfolderBase]: 1120/2102 cut-off events. [2023-11-21 22:23:55,574 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2023-11-21 22:23:55,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5167 conditions, 2102 events. 1120/2102 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 16519 event pairs, 239 based on Foata normal form. 0/2028 useless extension candidates. Maximal degree in co-relation 5151. Up to 923 conditions per place. [2023-11-21 22:23:55,591 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 63 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2023-11-21 22:23:55,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 95 transitions, 503 flow [2023-11-21 22:23:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:23:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:23:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 288 transitions. [2023-11-21 22:23:55,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45569620253164556 [2023-11-21 22:23:55,594 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 288 transitions. [2023-11-21 22:23:55,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 288 transitions. [2023-11-21 22:23:55,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:55,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 288 transitions. [2023-11-21 22:23:55,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:55,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:55,599 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:55,599 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 150 flow. Second operand 8 states and 288 transitions. [2023-11-21 22:23:55,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 95 transitions, 503 flow [2023-11-21 22:23:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 491 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:23:55,603 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 240 flow [2023-11-21 22:23:55,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-11-21 22:23:55,604 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-11-21 22:23:55,604 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 240 flow [2023-11-21 22:23:55,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:55,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:55,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:55,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:23:55,605 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:55,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -5443353, now seen corresponding path program 1 times [2023-11-21 22:23:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323106984] [2023-11-21 22:23:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:56,039 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-21 22:23:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323106984] [2023-11-21 22:23:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323106984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:56,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:56,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:23:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079351602] [2023-11-21 22:23:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:23:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:23:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:23:56,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:56,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:56,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:56,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:56,626 INFO L124 PetriNetUnfolderBase]: 730/1439 cut-off events. [2023-11-21 22:23:56,627 INFO L125 PetriNetUnfolderBase]: For 886/886 co-relation queries the response was YES. [2023-11-21 22:23:56,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1439 events. 730/1439 cut-off events. For 886/886 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10851 event pairs, 293 based on Foata normal form. 56/1452 useless extension candidates. Maximal degree in co-relation 3735. Up to 620 conditions per place. [2023-11-21 22:23:56,638 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 20 selfloop transitions, 3 changer transitions 21/63 dead transitions. [2023-11-21 22:23:56,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 343 flow [2023-11-21 22:23:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:23:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:23:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-21 22:23:56,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42616033755274263 [2023-11-21 22:23:56,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-21 22:23:56,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-21 22:23:56,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:56,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-21 22:23:56,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,644 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,644 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 240 flow. Second operand 6 states and 202 transitions. [2023-11-21 22:23:56,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 343 flow [2023-11-21 22:23:56,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:23:56,650 INFO L231 Difference]: Finished difference. Result has 70 places, 37 transitions, 115 flow [2023-11-21 22:23:56,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=70, PETRI_TRANSITIONS=37} [2023-11-21 22:23:56,651 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-11-21 22:23:56,651 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 37 transitions, 115 flow [2023-11-21 22:23:56,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:56,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:56,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:23:56,652 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:56,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -277217660, now seen corresponding path program 1 times [2023-11-21 22:23:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948020276] [2023-11-21 22:23:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:56,904 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-21 22:23:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948020276] [2023-11-21 22:23:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948020276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184803118] [2023-11-21 22:23:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:56,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:23:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:56,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:56,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:23:56,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2023-11-21 22:23:56,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 37 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:56,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:56,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2023-11-21 22:23:56,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:57,624 INFO L124 PetriNetUnfolderBase]: 983/1781 cut-off events. [2023-11-21 22:23:57,625 INFO L125 PetriNetUnfolderBase]: For 899/899 co-relation queries the response was YES. [2023-11-21 22:23:57,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 1781 events. 983/1781 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11530 event pairs, 137 based on Foata normal form. 48/1808 useless extension candidates. Maximal degree in co-relation 4323. Up to 838 conditions per place. [2023-11-21 22:23:57,637 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 28 selfloop transitions, 2 changer transitions 39/85 dead transitions. [2023-11-21 22:23:57,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 407 flow [2023-11-21 22:23:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:23:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:23:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 279 transitions. [2023-11-21 22:23:57,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44145569620253167 [2023-11-21 22:23:57,639 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 279 transitions. [2023-11-21 22:23:57,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 279 transitions. [2023-11-21 22:23:57,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:57,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 279 transitions. [2023-11-21 22:23:57,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 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-21 22:23:57,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:57,643 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:57,644 INFO L175 Difference]: Start difference. First operand has 70 places, 37 transitions, 115 flow. Second operand 8 states and 279 transitions. [2023-11-21 22:23:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 407 flow [2023-11-21 22:23:57,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 370 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-11-21 22:23:57,649 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 106 flow [2023-11-21 22:23:57,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2023-11-21 22:23:57,650 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2023-11-21 22:23:57,650 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 106 flow [2023-11-21 22:23:57,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:57,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:57,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:57,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:23:57,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:57,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1417287805, now seen corresponding path program 1 times [2023-11-21 22:23:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510616074] [2023-11-21 22:23:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:57,830 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-21 22:23:57,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510616074] [2023-11-21 22:23:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510616074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:23:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478641256] [2023-11-21 22:23:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:57,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:23:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:23:57,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2023-11-21 22:23:57,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-21 22:23:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2023-11-21 22:23:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:58,338 INFO L124 PetriNetUnfolderBase]: 671/1199 cut-off events. [2023-11-21 22:23:58,338 INFO L125 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2023-11-21 22:23:58,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3099 conditions, 1199 events. 671/1199 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7092 event pairs, 431 based on Foata normal form. 36/1212 useless extension candidates. Maximal degree in co-relation 3081. Up to 673 conditions per place. [2023-11-21 22:23:58,347 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 28 selfloop transitions, 2 changer transitions 27/73 dead transitions. [2023-11-21 22:23:58,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 339 flow [2023-11-21 22:23:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:23:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:23:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2023-11-21 22:23:58,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358047016274864 [2023-11-21 22:23:58,350 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 241 transitions. [2023-11-21 22:23:58,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 241 transitions. [2023-11-21 22:23:58,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:58,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 241 transitions. [2023-11-21 22:23:58,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,353 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,353 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 106 flow. Second operand 7 states and 241 transitions. [2023-11-21 22:23:58,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 339 flow [2023-11-21 22:23:58,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 319 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-21 22:23:58,358 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 110 flow [2023-11-21 22:23:58,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-11-21 22:23:58,359 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-11-21 22:23:58,359 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 110 flow [2023-11-21 22:23:58,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-21 22:23:58,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:58,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:58,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:23:58,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:58,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2012392852, now seen corresponding path program 1 times [2023-11-21 22:23:58,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892199319] [2023-11-21 22:23:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:58,644 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-21 22:23:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892199319] [2023-11-21 22:23:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892199319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:58,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091160001] [2023-11-21 22:23:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:58,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:23:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:58,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:23:58,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-21 22:23:58,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 36 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:58,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-21 22:23:58,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:58,960 INFO L124 PetriNetUnfolderBase]: 339/694 cut-off events. [2023-11-21 22:23:58,960 INFO L125 PetriNetUnfolderBase]: For 339/351 co-relation queries the response was YES. [2023-11-21 22:23:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 694 events. 339/694 cut-off events. For 339/351 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4025 event pairs, 173 based on Foata normal form. 24/709 useless extension candidates. Maximal degree in co-relation 1663. Up to 353 conditions per place. [2023-11-21 22:23:58,965 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 27 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-11-21 22:23:58,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 319 flow [2023-11-21 22:23:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:23:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:23:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2023-11-21 22:23:58,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45207956600361665 [2023-11-21 22:23:58,968 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 250 transitions. [2023-11-21 22:23:58,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 250 transitions. [2023-11-21 22:23:58,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:58,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 250 transitions. [2023-11-21 22:23:58,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,971 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,971 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 110 flow. Second operand 7 states and 250 transitions. [2023-11-21 22:23:58,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 319 flow [2023-11-21 22:23:58,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 299 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-21 22:23:58,975 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 114 flow [2023-11-21 22:23:58,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2023-11-21 22:23:58,976 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-21 22:23:58,976 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 114 flow [2023-11-21 22:23:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:58,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:58,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:23:58,977 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:58,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1984257205, now seen corresponding path program 1 times [2023-11-21 22:23:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629433576] [2023-11-21 22:23:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:59,244 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-21 22:23:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629433576] [2023-11-21 22:23:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629433576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:23:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490749877] [2023-11-21 22:23:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:59,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:23:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:23:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:23:59,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:23:59,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 36 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:59,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:23:59,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:23:59,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:23:59,771 INFO L124 PetriNetUnfolderBase]: 915/1642 cut-off events. [2023-11-21 22:23:59,771 INFO L125 PetriNetUnfolderBase]: For 845/845 co-relation queries the response was YES. [2023-11-21 22:23:59,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 1642 events. 915/1642 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10563 event pairs, 118 based on Foata normal form. 16/1653 useless extension candidates. Maximal degree in co-relation 4335. Up to 591 conditions per place. [2023-11-21 22:23:59,782 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 32 selfloop transitions, 3 changer transitions 19/69 dead transitions. [2023-11-21 22:23:59,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 327 flow [2023-11-21 22:23:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:23:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:23:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-21 22:23:59,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43248945147679324 [2023-11-21 22:23:59,784 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-21 22:23:59,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-21 22:23:59,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:59,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-21 22:23:59,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:59,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:59,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:59,787 INFO L175 Difference]: Start difference. First operand has 61 places, 36 transitions, 114 flow. Second operand 6 states and 205 transitions. [2023-11-21 22:23:59,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 327 flow [2023-11-21 22:23:59,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 307 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-21 22:23:59,792 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 116 flow [2023-11-21 22:23:59,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-11-21 22:23:59,792 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2023-11-21 22:23:59,793 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 116 flow [2023-11-21 22:23:59,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:59,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:23:59,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:59,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:23:59,794 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:23:59,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash -218168441, now seen corresponding path program 2 times [2023-11-21 22:23:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775991367] [2023-11-21 22:23:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:01,757 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-21 22:24:01,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775991367] [2023-11-21 22:24:01,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775991367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:01,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 22:24:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217179976] [2023-11-21 22:24:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:01,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:24:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:24:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:24:01,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 79 [2023-11-21 22:24:01,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 116 flow. Second operand has 11 states, 11 states have (on average 24.454545454545453) internal successors, (269), 11 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:01,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:01,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 79 [2023-11-21 22:24:01,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:02,831 INFO L124 PetriNetUnfolderBase]: 390/771 cut-off events. [2023-11-21 22:24:02,831 INFO L125 PetriNetUnfolderBase]: For 398/406 co-relation queries the response was YES. [2023-11-21 22:24:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 771 events. 390/771 cut-off events. For 398/406 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4643 event pairs, 181 based on Foata normal form. 16/750 useless extension candidates. Maximal degree in co-relation 1885. Up to 452 conditions per place. [2023-11-21 22:24:02,838 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 36 selfloop transitions, 8 changer transitions 23/82 dead transitions. [2023-11-21 22:24:02,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 384 flow [2023-11-21 22:24:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:24:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-21 22:24:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 369 transitions. [2023-11-21 22:24:02,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592989289191821 [2023-11-21 22:24:02,842 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 369 transitions. [2023-11-21 22:24:02,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 369 transitions. [2023-11-21 22:24:02,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:02,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 369 transitions. [2023-11-21 22:24:02,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 28.384615384615383) internal successors, (369), 13 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:02,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:02,847 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:02,847 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 116 flow. Second operand 13 states and 369 transitions. [2023-11-21 22:24:02,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 384 flow [2023-11-21 22:24:02,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 354 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-21 22:24:02,851 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 186 flow [2023-11-21 22:24:02,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=186, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2023-11-21 22:24:02,852 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-11-21 22:24:02,852 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 186 flow [2023-11-21 22:24:02,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.454545454545453) internal successors, (269), 11 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:02,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:02,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:02,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:24:02,853 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:02,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1513685399, now seen corresponding path program 3 times [2023-11-21 22:24:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:02,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11907182] [2023-11-21 22:24:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:04,518 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-21 22:24:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11907182] [2023-11-21 22:24:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11907182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:04,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:04,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 22:24:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876211886] [2023-11-21 22:24:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 22:24:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 22:24:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:24:04,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 79 [2023-11-21 22:24:04,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 43 transitions, 186 flow. Second operand has 12 states, 12 states have (on average 23.333333333333332) internal successors, (280), 12 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:04,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:04,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 79 [2023-11-21 22:24:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:05,498 INFO L124 PetriNetUnfolderBase]: 458/890 cut-off events. [2023-11-21 22:24:05,498 INFO L125 PetriNetUnfolderBase]: For 1413/1419 co-relation queries the response was YES. [2023-11-21 22:24:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 890 events. 458/890 cut-off events. For 1413/1419 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5495 event pairs, 165 based on Foata normal form. 16/866 useless extension candidates. Maximal degree in co-relation 2716. Up to 456 conditions per place. [2023-11-21 22:24:05,504 INFO L140 encePairwiseOnDemand]: 68/79 looper letters, 37 selfloop transitions, 15 changer transitions 23/90 dead transitions. [2023-11-21 22:24:05,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 538 flow [2023-11-21 22:24:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-21 22:24:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-21 22:24:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 380 transitions. [2023-11-21 22:24:05,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3435804701627486 [2023-11-21 22:24:05,507 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 380 transitions. [2023-11-21 22:24:05,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 380 transitions. [2023-11-21 22:24:05,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:05,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 380 transitions. [2023-11-21 22:24:05,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 27.142857142857142) internal successors, (380), 14 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:05,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 79.0) internal successors, (1185), 15 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:05,512 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 79.0) internal successors, (1185), 15 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:05,512 INFO L175 Difference]: Start difference. First operand has 74 places, 43 transitions, 186 flow. Second operand 14 states and 380 transitions. [2023-11-21 22:24:05,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 538 flow [2023-11-21 22:24:05,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 515 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-21 22:24:05,519 INFO L231 Difference]: Finished difference. Result has 88 places, 52 transitions, 312 flow [2023-11-21 22:24:05,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=312, PETRI_PLACES=88, PETRI_TRANSITIONS=52} [2023-11-21 22:24:05,520 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2023-11-21 22:24:05,520 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 52 transitions, 312 flow [2023-11-21 22:24:05,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.333333333333332) internal successors, (280), 12 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:05,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:05,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:05,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 22:24:05,521 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:05,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash 321909723, now seen corresponding path program 4 times [2023-11-21 22:24:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656476956] [2023-11-21 22:24:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:07,699 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-21 22:24:07,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:07,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656476956] [2023-11-21 22:24:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656476956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:07,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:07,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 22:24:07,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182318945] [2023-11-21 22:24:07,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:07,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:24:07,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:24:07,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:24:07,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 79 [2023-11-21 22:24:07,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 52 transitions, 312 flow. Second operand has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:07,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:07,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 79 [2023-11-21 22:24:07,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:09,011 INFO L124 PetriNetUnfolderBase]: 474/929 cut-off events. [2023-11-21 22:24:09,012 INFO L125 PetriNetUnfolderBase]: For 3707/3715 co-relation queries the response was YES. [2023-11-21 22:24:09,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 929 events. 474/929 cut-off events. For 3707/3715 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5879 event pairs, 26 based on Foata normal form. 22/910 useless extension candidates. Maximal degree in co-relation 3467. Up to 359 conditions per place. [2023-11-21 22:24:09,022 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 41 selfloop transitions, 20 changer transitions 25/101 dead transitions. [2023-11-21 22:24:09,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 101 transitions, 776 flow [2023-11-21 22:24:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:24:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-21 22:24:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 408 transitions. [2023-11-21 22:24:09,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34430379746835443 [2023-11-21 22:24:09,027 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 408 transitions. [2023-11-21 22:24:09,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 408 transitions. [2023-11-21 22:24:09,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:09,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 408 transitions. [2023-11-21 22:24:09,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 27.2) internal successors, (408), 15 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:09,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 79.0) internal successors, (1264), 16 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:09,040 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 79.0) internal successors, (1264), 16 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:09,040 INFO L175 Difference]: Start difference. First operand has 88 places, 52 transitions, 312 flow. Second operand 15 states and 408 transitions. [2023-11-21 22:24:09,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 101 transitions, 776 flow [2023-11-21 22:24:09,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 656 flow, removed 55 selfloop flow, removed 8 redundant places. [2023-11-21 22:24:09,057 INFO L231 Difference]: Finished difference. Result has 97 places, 57 transitions, 389 flow [2023-11-21 22:24:09,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=389, PETRI_PLACES=97, PETRI_TRANSITIONS=57} [2023-11-21 22:24:09,058 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 13 predicate places. [2023-11-21 22:24:09,058 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 57 transitions, 389 flow [2023-11-21 22:24:09,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:09,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:09,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:09,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 22:24:09,059 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:09,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1156134075, now seen corresponding path program 1 times [2023-11-21 22:24:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113253983] [2023-11-21 22:24:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:09,308 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-21 22:24:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113253983] [2023-11-21 22:24:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113253983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:24:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350115044] [2023-11-21 22:24:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:24:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:24:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:24:09,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:24:09,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 57 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:09,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:09,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:24:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:09,993 INFO L124 PetriNetUnfolderBase]: 1189/2239 cut-off events. [2023-11-21 22:24:09,993 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2023-11-21 22:24:10,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8039 conditions, 2239 events. 1189/2239 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16394 event pairs, 480 based on Foata normal form. 12/2237 useless extension candidates. Maximal degree in co-relation 8001. Up to 912 conditions per place. [2023-11-21 22:24:10,007 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 47 selfloop transitions, 2 changer transitions 49/117 dead transitions. [2023-11-21 22:24:10,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 117 transitions, 1081 flow [2023-11-21 22:24:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:24:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:24:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2023-11-21 22:24:10,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213381555153707 [2023-11-21 22:24:10,009 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 233 transitions. [2023-11-21 22:24:10,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 233 transitions. [2023-11-21 22:24:10,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:10,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 233 transitions. [2023-11-21 22:24:10,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:10,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:10,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:10,012 INFO L175 Difference]: Start difference. First operand has 97 places, 57 transitions, 389 flow. Second operand 7 states and 233 transitions. [2023-11-21 22:24:10,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 117 transitions, 1081 flow [2023-11-21 22:24:10,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 117 transitions, 942 flow, removed 52 selfloop flow, removed 12 redundant places. [2023-11-21 22:24:10,036 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 344 flow [2023-11-21 22:24:10,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=79, 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=7, PETRI_FLOW=344, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2023-11-21 22:24:10,037 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2023-11-21 22:24:10,037 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 344 flow [2023-11-21 22:24:10,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:10,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:10,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:10,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-21 22:24:10,038 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:10,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash -672048771, now seen corresponding path program 2 times [2023-11-21 22:24:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:10,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480611349] [2023-11-21 22:24:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:11,692 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-21 22:24:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480611349] [2023-11-21 22:24:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480611349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-21 22:24:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329415293] [2023-11-21 22:24:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:11,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-21 22:24:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:24:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:24:11,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 79 [2023-11-21 22:24:11,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 344 flow. Second operand has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:11,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:11,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 79 [2023-11-21 22:24:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:12,671 INFO L124 PetriNetUnfolderBase]: 450/902 cut-off events. [2023-11-21 22:24:12,672 INFO L125 PetriNetUnfolderBase]: For 2243/2290 co-relation queries the response was YES. [2023-11-21 22:24:12,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 902 events. 450/902 cut-off events. For 2243/2290 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5692 event pairs, 144 based on Foata normal form. 12/866 useless extension candidates. Maximal degree in co-relation 3038. Up to 488 conditions per place. [2023-11-21 22:24:12,681 INFO L140 encePairwiseOnDemand]: 68/79 looper letters, 44 selfloop transitions, 18 changer transitions 15/92 dead transitions. [2023-11-21 22:24:12,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 672 flow [2023-11-21 22:24:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:24:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-21 22:24:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 327 transitions. [2023-11-21 22:24:12,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3449367088607595 [2023-11-21 22:24:12,684 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 327 transitions. [2023-11-21 22:24:12,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 327 transitions. [2023-11-21 22:24:12,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:12,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 327 transitions. [2023-11-21 22:24:12,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:12,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 79.0) internal successors, (1027), 13 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:12,688 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 79.0) internal successors, (1027), 13 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:12,688 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 344 flow. Second operand 12 states and 327 transitions. [2023-11-21 22:24:12,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 672 flow [2023-11-21 22:24:12,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 646 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-21 22:24:12,698 INFO L231 Difference]: Finished difference. Result has 96 places, 63 transitions, 463 flow [2023-11-21 22:24:12,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=463, PETRI_PLACES=96, PETRI_TRANSITIONS=63} [2023-11-21 22:24:12,699 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 12 predicate places. [2023-11-21 22:24:12,699 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 63 transitions, 463 flow [2023-11-21 22:24:12,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:12,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:12,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:12,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-21 22:24:12,700 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:12,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1009168361, now seen corresponding path program 3 times [2023-11-21 22:24:12,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374524970] [2023-11-21 22:24:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:14,070 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-21 22:24:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374524970] [2023-11-21 22:24:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374524970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 22:24:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120910103] [2023-11-21 22:24:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 22:24:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 22:24:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:24:14,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 79 [2023-11-21 22:24:14,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 63 transitions, 463 flow. Second operand has 12 states, 12 states have (on average 23.416666666666668) internal successors, (281), 12 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:14,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:14,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 79 [2023-11-21 22:24:14,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:14,977 INFO L124 PetriNetUnfolderBase]: 454/901 cut-off events. [2023-11-21 22:24:14,977 INFO L125 PetriNetUnfolderBase]: For 3910/3999 co-relation queries the response was YES. [2023-11-21 22:24:14,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 901 events. 454/901 cut-off events. For 3910/3999 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5604 event pairs, 36 based on Foata normal form. 22/880 useless extension candidates. Maximal degree in co-relation 3398. Up to 404 conditions per place. [2023-11-21 22:24:14,985 INFO L140 encePairwiseOnDemand]: 69/79 looper letters, 48 selfloop transitions, 24 changer transitions 15/102 dead transitions. [2023-11-21 22:24:14,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 834 flow [2023-11-21 22:24:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:24:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-21 22:24:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 354 transitions. [2023-11-21 22:24:14,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34469328140214217 [2023-11-21 22:24:14,990 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 354 transitions. [2023-11-21 22:24:14,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 354 transitions. [2023-11-21 22:24:14,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:14,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 354 transitions. [2023-11-21 22:24:14,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 27.23076923076923) internal successors, (354), 13 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:14,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:14,994 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:14,994 INFO L175 Difference]: Start difference. First operand has 96 places, 63 transitions, 463 flow. Second operand 13 states and 354 transitions. [2023-11-21 22:24:14,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 834 flow [2023-11-21 22:24:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 767 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-11-21 22:24:15,007 INFO L231 Difference]: Finished difference. Result has 102 places, 70 transitions, 576 flow [2023-11-21 22:24:15,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=576, PETRI_PLACES=102, PETRI_TRANSITIONS=70} [2023-11-21 22:24:15,008 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 18 predicate places. [2023-11-21 22:24:15,008 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 70 transitions, 576 flow [2023-11-21 22:24:15,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.416666666666668) internal successors, (281), 12 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:15,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:15,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:15,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-21 22:24:15,009 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:15,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 145290815, now seen corresponding path program 4 times [2023-11-21 22:24:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538177891] [2023-11-21 22:24:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:15,194 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-21 22:24:15,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538177891] [2023-11-21 22:24:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538177891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:24:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397233179] [2023-11-21 22:24:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:15,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:24:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:24:15,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:24:15,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:24:15,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 70 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-21 22:24:15,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:15,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:24:15,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:15,816 INFO L124 PetriNetUnfolderBase]: 1454/2363 cut-off events. [2023-11-21 22:24:15,816 INFO L125 PetriNetUnfolderBase]: For 14203/14209 co-relation queries the response was YES. [2023-11-21 22:24:15,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9455 conditions, 2363 events. 1454/2363 cut-off events. For 14203/14209 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13753 event pairs, 132 based on Foata normal form. 105/2431 useless extension candidates. Maximal degree in co-relation 9417. Up to 1261 conditions per place. [2023-11-21 22:24:15,834 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 85 selfloop transitions, 5 changer transitions 1/109 dead transitions. [2023-11-21 22:24:15,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 1167 flow [2023-11-21 22:24:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:24:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:24:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2023-11-21 22:24:15,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588607594936709 [2023-11-21 22:24:15,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 145 transitions. [2023-11-21 22:24:15,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions. [2023-11-21 22:24:15,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:15,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions. [2023-11-21 22:24:15,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:15,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:15,837 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:15,838 INFO L175 Difference]: Start difference. First operand has 102 places, 70 transitions, 576 flow. Second operand 4 states and 145 transitions. [2023-11-21 22:24:15,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 1167 flow [2023-11-21 22:24:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 1110 flow, removed 18 selfloop flow, removed 8 redundant places. [2023-11-21 22:24:15,862 INFO L231 Difference]: Finished difference. Result has 95 places, 73 transitions, 568 flow [2023-11-21 22:24:15,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=568, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2023-11-21 22:24:15,863 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2023-11-21 22:24:15,863 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 568 flow [2023-11-21 22:24:15,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-21 22:24:15,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:15,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:15,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-21 22:24:15,864 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:15,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash -166934598, now seen corresponding path program 1 times [2023-11-21 22:24:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367564028] [2023-11-21 22:24:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:16,137 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-21 22:24:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367564028] [2023-11-21 22:24:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367564028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:16,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:24:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964192329] [2023-11-21 22:24:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:24:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:24:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:24:16,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:24:16,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:16,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:24:16,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:16,609 INFO L124 PetriNetUnfolderBase]: 1055/1763 cut-off events. [2023-11-21 22:24:16,609 INFO L125 PetriNetUnfolderBase]: For 9691/9719 co-relation queries the response was YES. [2023-11-21 22:24:16,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 1763 events. 1055/1763 cut-off events. For 9691/9719 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9419 event pairs, 43 based on Foata normal form. 98/1829 useless extension candidates. Maximal degree in co-relation 7293. Up to 685 conditions per place. [2023-11-21 22:24:16,621 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 95 selfloop transitions, 8 changer transitions 1/122 dead transitions. [2023-11-21 22:24:16,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 1305 flow [2023-11-21 22:24:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:24:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:24:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-21 22:24:16,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607594936708861 [2023-11-21 22:24:16,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-21 22:24:16,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-21 22:24:16,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:16,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-21 22:24:16,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,625 INFO L175 Difference]: Start difference. First operand has 95 places, 73 transitions, 568 flow. Second operand 5 states and 182 transitions. [2023-11-21 22:24:16,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 1305 flow [2023-11-21 22:24:16,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 122 transitions, 1279 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-21 22:24:16,641 INFO L231 Difference]: Finished difference. Result has 97 places, 73 transitions, 576 flow [2023-11-21 22:24:16,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=576, PETRI_PLACES=97, PETRI_TRANSITIONS=73} [2023-11-21 22:24:16,642 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 13 predicate places. [2023-11-21 22:24:16,642 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 73 transitions, 576 flow [2023-11-21 22:24:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:16,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:16,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-21 22:24:16,643 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:16,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1186560905, now seen corresponding path program 1 times [2023-11-21 22:24:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171158063] [2023-11-21 22:24:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:16,943 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-21 22:24:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:16,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171158063] [2023-11-21 22:24:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171158063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:16,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:24:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090862319] [2023-11-21 22:24:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:16,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:24:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:24:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:24:16,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:24:16,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 73 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:16,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:16,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:24:16,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:17,284 INFO L124 PetriNetUnfolderBase]: 622/1072 cut-off events. [2023-11-21 22:24:17,284 INFO L125 PetriNetUnfolderBase]: For 6437/6500 co-relation queries the response was YES. [2023-11-21 22:24:17,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4626 conditions, 1072 events. 622/1072 cut-off events. For 6437/6500 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5099 event pairs, 42 based on Foata normal form. 62/1107 useless extension candidates. Maximal degree in co-relation 4588. Up to 472 conditions per place. [2023-11-21 22:24:17,292 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 72 selfloop transitions, 11 changer transitions 1/102 dead transitions. [2023-11-21 22:24:17,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 1019 flow [2023-11-21 22:24:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:24:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:24:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-21 22:24:17,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43248945147679324 [2023-11-21 22:24:17,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-21 22:24:17,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-21 22:24:17,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:17,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-21 22:24:17,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:17,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:17,304 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:17,305 INFO L175 Difference]: Start difference. First operand has 97 places, 73 transitions, 576 flow. Second operand 6 states and 205 transitions. [2023-11-21 22:24:17,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 1019 flow [2023-11-21 22:24:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 102 transitions, 757 flow, removed 39 selfloop flow, removed 18 redundant places. [2023-11-21 22:24:17,318 INFO L231 Difference]: Finished difference. Result has 86 places, 60 transitions, 352 flow [2023-11-21 22:24:17,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=86, PETRI_TRANSITIONS=60} [2023-11-21 22:24:17,318 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 2 predicate places. [2023-11-21 22:24:17,319 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 60 transitions, 352 flow [2023-11-21 22:24:17,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:17,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:17,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:17,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-21 22:24:17,320 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:17,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 484408431, now seen corresponding path program 1 times [2023-11-21 22:24:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550914074] [2023-11-21 22:24:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:24:17,581 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-21 22:24:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:24:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550914074] [2023-11-21 22:24:17,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550914074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:24:17,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:24:17,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:24:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528968038] [2023-11-21 22:24:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:24:17,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:24:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:24:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:24:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:24:17,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-21 22:24:17,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 60 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:17,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:24:17,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-21 22:24:17,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:24:18,017 INFO L124 PetriNetUnfolderBase]: 723/1509 cut-off events. [2023-11-21 22:24:18,017 INFO L125 PetriNetUnfolderBase]: For 2416/2436 co-relation queries the response was YES. [2023-11-21 22:24:18,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 1509 events. 723/1509 cut-off events. For 2416/2436 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9446 event pairs, 249 based on Foata normal form. 8/1470 useless extension candidates. Maximal degree in co-relation 4497. Up to 547 conditions per place. [2023-11-21 22:24:18,029 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 40 selfloop transitions, 2 changer transitions 27/94 dead transitions. [2023-11-21 22:24:18,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 679 flow [2023-11-21 22:24:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:24:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:24:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-21 22:24:18,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41350210970464135 [2023-11-21 22:24:18,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-21 22:24:18,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-21 22:24:18,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:24:18,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-21 22:24:18,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:18,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:18,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:18,033 INFO L175 Difference]: Start difference. First operand has 86 places, 60 transitions, 352 flow. Second operand 6 states and 196 transitions. [2023-11-21 22:24:18,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 679 flow [2023-11-21 22:24:18,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 615 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-21 22:24:18,045 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 291 flow [2023-11-21 22:24:18,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2023-11-21 22:24:18,047 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2023-11-21 22:24:18,047 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 291 flow [2023-11-21 22:24:18,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:24:18,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:24:18,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:18,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-21 22:24:18,048 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-21 22:24:18,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:24:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2098325107, now seen corresponding path program 2 times [2023-11-21 22:24:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:24:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410430716] [2023-11-21 22:24:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:24:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:24:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:24:18,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:24:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:24:18,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:24:18,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:24:18,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2023-11-21 22:24:18,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-11-21 22:24:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-11-21 22:24:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-11-21 22:24:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-11-21 22:24:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-11-21 22:24:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-11-21 22:24:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-11-21 22:24:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-11-21 22:24:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-11-21 22:24:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-11-21 22:24:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-11-21 22:24:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-11-21 22:24:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-11-21 22:24:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-11-21 22:24:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-11-21 22:24:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-11-21 22:24:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 59 remaining) [2023-11-21 22:24:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-11-21 22:24:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-11-21 22:24:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-11-21 22:24:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-11-21 22:24:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-11-21 22:24:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-11-21 22:24:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-11-21 22:24:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-11-21 22:24:18,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-11-21 22:24:18,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-11-21 22:24:18,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-11-21 22:24:18,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-11-21 22:24:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-11-21 22:24:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-11-21 22:24:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-11-21 22:24:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-11-21 22:24:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (24 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-11-21 22:24:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-11-21 22:24:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-11-21 22:24:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-11-21 22:24:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-11-21 22:24:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-11-21 22:24:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-11-21 22:24:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-11-21 22:24:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-11-21 22:24:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-11-21 22:24:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-11-21 22:24:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-11-21 22:24:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-11-21 22:24:18,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-11-21 22:24:18,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-11-21 22:24:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-21 22:24:18,258 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:24:18,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:24:18,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:24:18,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-21 22:24:18,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-21 22:24:18,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated [2023-11-21 22:24:18,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:24:18,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:24:18,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:24:18 BasicIcfg [2023-11-21 22:24:18,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:24:18,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:24:18,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:24:18,428 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:24:18,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:42" (3/4) ... [2023-11-21 22:24:18,431 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:24:18,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:24:18,433 INFO L158 Benchmark]: Toolchain (without parser) took 38972.13ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 132.4MB in the beginning and 520.4MB in the end (delta: -387.9MB). Peak memory consumption was 793.8MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,434 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:24:18,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.40ms. Allocated memory is still 180.4MB. Free memory was 132.0MB in the beginning and 108.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.79ms. Allocated memory is still 180.4MB. Free memory was 108.0MB in the beginning and 105.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,435 INFO L158 Benchmark]: Boogie Preprocessor took 68.52ms. Allocated memory is still 180.4MB. Free memory was 105.5MB in the beginning and 103.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,435 INFO L158 Benchmark]: RCFGBuilder took 1732.96ms. Allocated memory is still 180.4MB. Free memory was 103.1MB in the beginning and 92.3MB in the end (delta: 10.8MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,436 INFO L158 Benchmark]: TraceAbstraction took 36211.99ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.2MB in the beginning and 521.4MB in the end (delta: -430.2MB). Peak memory consumption was 747.4MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,436 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 1.4GB. Free memory was 521.4MB in the beginning and 520.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:24:18,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.40ms. Allocated memory is still 180.4MB. Free memory was 132.0MB in the beginning and 108.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.79ms. Allocated memory is still 180.4MB. Free memory was 108.0MB in the beginning and 105.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.52ms. Allocated memory is still 180.4MB. Free memory was 105.5MB in the beginning and 103.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1732.96ms. Allocated memory is still 180.4MB. Free memory was 103.1MB in the beginning and 92.3MB in the end (delta: 10.8MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36211.99ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.2MB in the beginning and 521.4MB in the end (delta: -430.2MB). Peak memory consumption was 747.4MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 1.4GB. Free memory was 521.4MB in the beginning and 520.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre26 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={8:0}, weak$$choice0=0, weak$$choice1=1, 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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={5:0}, t2102={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: 18]: 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: -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: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 123 locations, 59 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: 35.8s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1918 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1662 mSDsluCounter, 1088 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4664 IncrementalHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 55 mSDtfsCounter, 4664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=576occurred in iteration=25, InterpolantAutomatonStates: 183, 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.7s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 484 ConstructedInterpolants, 0 QuantifiedInterpolants, 5098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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-21 22:24:18,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c1291bd-2704-4e87-90d4-0cdae9fd329c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...