./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:26:24,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:26:24,920 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:26:24,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:26:24,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:26:24,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:26:24,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:26:24,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:26:24,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:26:24,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:26:24,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:26:24,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:26:24,954 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:26:24,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:26:24,956 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:26:24,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:26:24,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:26:24,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:26:24,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:26:24,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:26:24,959 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:26:24,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:26:24,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:26:24,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:26:24,961 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:26:24,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:26:24,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:26:24,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:26:24,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:26:24,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:26:24,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:24,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:26:24,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:26:24,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:26:24,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:26:24,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:26:24,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:26:24,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:26:24,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:26:24,967 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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-21 22:26:25,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:26:25,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:26:25,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:26:25,230 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:26:25,230 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:26:25,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-21 22:26:28,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:26:28,579 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:26:28,580 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-21 22:26:28,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/518fb974f/d60e422f65d04f8681dc8cfef7adb452/FLAG703863cb5 [2023-11-21 22:26:28,619 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/518fb974f/d60e422f65d04f8681dc8cfef7adb452 [2023-11-21 22:26:28,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:26:28,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:26:28,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:28,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:26:28,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:26:28,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:28" (1/1) ... [2023-11-21 22:26:28,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4748bf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:28, skipping insertion in model container [2023-11-21 22:26:28,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:28" (1/1) ... [2023-11-21 22:26:28,692 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:26:29,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:29,195 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:26:29,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:29,356 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:29,356 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:29,364 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:26:29,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29 WrapperNode [2023-11-21 22:26:29,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:29,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:29,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:26:29,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:26:29,374 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:26:29" (1/1) ... [2023-11-21 22:26:29,408 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:26:29" (1/1) ... [2023-11-21 22:26:29,468 INFO L138 Inliner]: procedures = 175, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-21 22:26:29,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:29,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:26:29,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:26:29,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:26:29,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:26:29,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:26:29,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:26:29,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:26:29,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (1/1) ... [2023-11-21 22:26:29,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:26:29,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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:26:29,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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:26:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:26:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:26:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:26:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:26:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:26:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:26:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:26:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:26:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:26:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:26:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:26:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:26:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:26:29,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:26:29,680 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:26:29,885 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:26:29,887 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:26:30,551 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:26:31,132 WARN L1820 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-21 22:26:31,291 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:26:31,291 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:26:31,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:31 BoogieIcfgContainer [2023-11-21 22:26:31,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:26:31,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:26:31,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:26:31,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:26:31,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:26:28" (1/3) ... [2023-11-21 22:26:31,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b885ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:26:31, skipping insertion in model container [2023-11-21 22:26:31,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:29" (2/3) ... [2023-11-21 22:26:31,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b885ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:26:31, skipping insertion in model container [2023-11-21 22:26:31,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:31" (3/3) ... [2023-11-21 22:26:31,306 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-21 22:26:31,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:26:31,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-21 22:26:31,328 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:26:31,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:26:31,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 98 transitions, 204 flow [2023-11-21 22:26:31,689 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2023-11-21 22:26:31,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:26:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 29/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-21 22:26:31,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 98 transitions, 204 flow [2023-11-21 22:26:31,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 96 transitions, 198 flow [2023-11-21 22:26:31,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:26:31,723 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;@46ed6c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:26:31,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-21 22:26:31,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:26:31,727 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:26:31,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:26:31,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:31,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:26:31,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:31,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 24987, now seen corresponding path program 1 times [2023-11-21 22:26:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205930505] [2023-11-21 22:26:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:32,057 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:26:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205930505] [2023-11-21 22:26:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205930505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557518462] [2023-11-21 22:26:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:32,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-21 22:26:32,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:26:32,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:32,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-21 22:26:32,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:33,802 INFO L124 PetriNetUnfolderBase]: 2747/4560 cut-off events. [2023-11-21 22:26:33,803 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-21 22:26:33,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 4560 events. 2747/4560 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33290 event pairs, 2020 based on Foata normal form. 180/2149 useless extension candidates. Maximal degree in co-relation 8688. Up to 3561 conditions per place. [2023-11-21 22:26:33,858 INFO L140 encePairwiseOnDemand]: 55/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-21 22:26:33,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 272 flow [2023-11-21 22:26:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-21 22:26:33,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-21 22:26:33,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-21 22:26:33,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-21 22:26:33,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:33,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-21 22:26:33,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:26:33,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:33,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:33,895 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 198 flow. Second operand 3 states and 189 transitions. [2023-11-21 22:26:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 272 flow [2023-11-21 22:26:33,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:33,908 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 116 flow [2023-11-21 22:26:33,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-11-21 22:26:33,915 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-11-21 22:26:33,915 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 116 flow [2023-11-21 22:26:33,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:26:33,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:33,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:26:33,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:26:33,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:33,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 24988, now seen corresponding path program 1 times [2023-11-21 22:26:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558576213] [2023-11-21 22:26:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:34,092 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:26:34,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:34,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558576213] [2023-11-21 22:26:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558576213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:34,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778198811] [2023-11-21 22:26:34,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:34,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:34,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:34,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:34,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:26:34,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:26:34,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:34,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:26:34,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:35,275 INFO L124 PetriNetUnfolderBase]: 2747/4559 cut-off events. [2023-11-21 22:26:35,275 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-21 22:26:35,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 4559 events. 2747/4559 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33250 event pairs, 2020 based on Foata normal form. 1/1969 useless extension candidates. Maximal degree in co-relation 8778. Up to 3560 conditions per place. [2023-11-21 22:26:35,317 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-21 22:26:35,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 270 flow [2023-11-21 22:26:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:26:35,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-21 22:26:35,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:26:35,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:26:35,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:35,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:26:35,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:35,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:35,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:35,330 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 116 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:26:35,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 270 flow [2023-11-21 22:26:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:35,342 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 114 flow [2023-11-21 22:26:35,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-21 22:26:35,343 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-21 22:26:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 114 flow [2023-11-21 22:26:35,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:26:35,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:35,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:26:35,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:26:35,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:35,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 745246956, now seen corresponding path program 1 times [2023-11-21 22:26:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980952198] [2023-11-21 22:26:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:35,449 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:26:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980952198] [2023-11-21 22:26:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980952198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146478004] [2023-11-21 22:26:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:35,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:35,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-21 22:26:35,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:26:35,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:35,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-21 22:26:35,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:36,599 INFO L124 PetriNetUnfolderBase]: 2755/4573 cut-off events. [2023-11-21 22:26:36,599 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-21 22:26:36,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 4573 events. 2755/4573 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33315 event pairs, 1132 based on Foata normal form. 0/2025 useless extension candidates. Maximal degree in co-relation 8809. Up to 3567 conditions per place. [2023-11-21 22:26:36,646 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-21 22:26:36,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 270 flow [2023-11-21 22:26:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-21 22:26:36,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2023-11-21 22:26:36,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-21 22:26:36,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-21 22:26:36,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:36,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-21 22:26:36,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:36,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:36,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:36,654 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 114 flow. Second operand 3 states and 111 transitions. [2023-11-21 22:26:36,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 270 flow [2023-11-21 22:26:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:36,665 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 112 flow [2023-11-21 22:26:36,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-11-21 22:26:36,667 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-21 22:26:36,667 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 112 flow [2023-11-21 22:26:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:26:36,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:36,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:26:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:26:36,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:36,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 745246957, now seen corresponding path program 1 times [2023-11-21 22:26:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:36,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188410886] [2023-11-21 22:26:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:36,797 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:26:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188410886] [2023-11-21 22:26:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188410886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732027443] [2023-11-21 22:26:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:36,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:36,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:36,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:26:36,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:26:36,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:36,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:26:36,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:37,842 INFO L124 PetriNetUnfolderBase]: 2747/4556 cut-off events. [2023-11-21 22:26:37,843 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-11-21 22:26:37,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8794 conditions, 4556 events. 2747/4556 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33170 event pairs, 1132 based on Foata normal form. 9/2023 useless extension candidates. Maximal degree in co-relation 8784. Up to 3550 conditions per place. [2023-11-21 22:26:37,887 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-21 22:26:37,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 266 flow [2023-11-21 22:26:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:26:37,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-21 22:26:37,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:26:37,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:26:37,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:37,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:26:37,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:37,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:37,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:37,893 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 112 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:26:37,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 266 flow [2023-11-21 22:26:37,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:37,900 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 110 flow [2023-11-21 22:26:37,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=110, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-11-21 22:26:37,902 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-11-21 22:26:37,902 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 110 flow [2023-11-21 22:26:37,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:26:37,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:37,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:26:37,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:26:37,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:37,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:37,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1627900314, now seen corresponding path program 1 times [2023-11-21 22:26:37,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821646809] [2023-11-21 22:26:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:38,050 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:26:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821646809] [2023-11-21 22:26:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821646809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257141662] [2023-11-21 22:26:38,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:38,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:38,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:38,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:26:38,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:38,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:38,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:39,235 INFO L124 PetriNetUnfolderBase]: 3591/6011 cut-off events. [2023-11-21 22:26:39,235 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-21 22:26:39,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11712 conditions, 6011 events. 3591/6011 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 48177 event pairs, 812 based on Foata normal form. 0/2736 useless extension candidates. Maximal degree in co-relation 11702. Up to 3214 conditions per place. [2023-11-21 22:26:39,271 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 65 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-21 22:26:39,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 312 flow [2023-11-21 22:26:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-21 22:26:39,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2023-11-21 22:26:39,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-21 22:26:39,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-21 22:26:39,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:39,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-21 22:26:39,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:26:39,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:39,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:39,277 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 110 flow. Second operand 3 states and 129 transitions. [2023-11-21 22:26:39,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 312 flow [2023-11-21 22:26:39,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:39,283 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 126 flow [2023-11-21 22:26:39,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-11-21 22:26:39,284 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-21 22:26:39,284 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 126 flow [2023-11-21 22:26:39,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:26:39,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:39,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:26:39,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:39,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696947, now seen corresponding path program 1 times [2023-11-21 22:26:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755873522] [2023-11-21 22:26:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:26:39,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755873522] [2023-11-21 22:26:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755873522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313295] [2023-11-21 22:26:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:39,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:39,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:26:39,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:39,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:40,661 INFO L124 PetriNetUnfolderBase]: 3732/6414 cut-off events. [2023-11-21 22:26:40,662 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2023-11-21 22:26:40,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13018 conditions, 6414 events. 3732/6414 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 51524 event pairs, 2036 based on Foata normal form. 45/3332 useless extension candidates. Maximal degree in co-relation 13005. Up to 4614 conditions per place. [2023-11-21 22:26:40,711 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 61 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2023-11-21 22:26:40,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 330 flow [2023-11-21 22:26:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-21 22:26:40,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2023-11-21 22:26:40,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-21 22:26:40,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-21 22:26:40,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:40,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-21 22:26:40,715 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:26:40,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:40,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:40,718 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 126 flow. Second operand 3 states and 127 transitions. [2023-11-21 22:26:40,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 330 flow [2023-11-21 22:26:40,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:40,722 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 177 flow [2023-11-21 22:26:40,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-21 22:26:40,726 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-21 22:26:40,726 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 177 flow [2023-11-21 22:26:40,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:26:40,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:40,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:26:40,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:40,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696946, now seen corresponding path program 1 times [2023-11-21 22:26:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261036262] [2023-11-21 22:26:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:40,907 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:26:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261036262] [2023-11-21 22:26:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261036262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:26:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066069971] [2023-11-21 22:26:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:40,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:26:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:26:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:26:40,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:26:40,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:26:40,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:40,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:26:40,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:42,083 INFO L124 PetriNetUnfolderBase]: 2127/3922 cut-off events. [2023-11-21 22:26:42,083 INFO L125 PetriNetUnfolderBase]: For 1259/1259 co-relation queries the response was YES. [2023-11-21 22:26:42,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9186 conditions, 3922 events. 2127/3922 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 30130 event pairs, 1207 based on Foata normal form. 0/2896 useless extension candidates. Maximal degree in co-relation 9172. Up to 2202 conditions per place. [2023-11-21 22:26:42,109 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 66 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2023-11-21 22:26:42,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 490 flow [2023-11-21 22:26:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:26:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:26:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-11-21 22:26:42,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38010204081632654 [2023-11-21 22:26:42,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 149 transitions. [2023-11-21 22:26:42,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 149 transitions. [2023-11-21 22:26:42,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:42,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 149 transitions. [2023-11-21 22:26:42,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:26:42,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:42,114 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:42,114 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 177 flow. Second operand 4 states and 149 transitions. [2023-11-21 22:26:42,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 490 flow [2023-11-21 22:26:42,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 462 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-21 22:26:42,118 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 316 flow [2023-11-21 22:26:42,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-11-21 22:26:42,119 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-11-21 22:26:42,119 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 316 flow [2023-11-21 22:26:42,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:26:42,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:42,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:42,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:26:42,121 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1074696945, now seen corresponding path program 1 times [2023-11-21 22:26:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492794222] [2023-11-21 22:26:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:26:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492794222] [2023-11-21 22:26:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492794222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:42,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:42,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590112369] [2023-11-21 22:26:42,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:42,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:42,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:42,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:42,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:42,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:42,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:26:42,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:42,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:42,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:42,682 INFO L124 PetriNetUnfolderBase]: 758/1496 cut-off events. [2023-11-21 22:26:42,682 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2023-11-21 22:26:42,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 1496 events. 758/1496 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10030 event pairs, 481 based on Foata normal form. 434/1686 useless extension candidates. Maximal degree in co-relation 4458. Up to 1274 conditions per place. [2023-11-21 22:26:42,692 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 46 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-11-21 22:26:42,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 394 flow [2023-11-21 22:26:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-21 22:26:42,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3129251700680272 [2023-11-21 22:26:42,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-21 22:26:42,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-21 22:26:42,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:42,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-21 22:26:42,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:42,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:42,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:42,696 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 316 flow. Second operand 3 states and 92 transitions. [2023-11-21 22:26:42,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 394 flow [2023-11-21 22:26:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:26:42,708 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 300 flow [2023-11-21 22:26:42,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2023-11-21 22:26:42,712 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-11-21 22:26:42,712 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 60 transitions, 300 flow [2023-11-21 22:26:42,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:26:42,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:42,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:26:42,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:42,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 781513312, now seen corresponding path program 1 times [2023-11-21 22:26:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368615797] [2023-11-21 22:26:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:42,871 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:26:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368615797] [2023-11-21 22:26:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368615797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:26:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048371339] [2023-11-21 22:26:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:42,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:26:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:26:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:26:42,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:42,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 60 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:26:42,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:42,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:43,271 INFO L124 PetriNetUnfolderBase]: 718/1429 cut-off events. [2023-11-21 22:26:43,271 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2023-11-21 22:26:43,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 1429 events. 718/1429 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9343 event pairs, 208 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 4246. Up to 1084 conditions per place. [2023-11-21 22:26:43,282 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 47 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2023-11-21 22:26:43,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 503 flow [2023-11-21 22:26:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:26:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:26:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-21 22:26:43,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2023-11-21 22:26:43,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-21 22:26:43,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-21 22:26:43,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:43,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-21 22:26:43,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:43,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:43,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:26:43,286 INFO L175 Difference]: Start difference. First operand has 54 places, 60 transitions, 300 flow. Second operand 3 states and 100 transitions. [2023-11-21 22:26:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 503 flow [2023-11-21 22:26:43,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:26:43,292 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 354 flow [2023-11-21 22:26:43,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2023-11-21 22:26:43,294 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-21 22:26:43,294 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 354 flow [2023-11-21 22:26:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:26:43,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:43,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:43,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:26:43,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:43,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -584866129, now seen corresponding path program 1 times [2023-11-21 22:26:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169199910] [2023-11-21 22:26:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:43,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:26:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169199910] [2023-11-21 22:26:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169199910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72008801] [2023-11-21 22:26:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:43,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:26:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:43,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:26:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:26:43,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:43,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:43,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:43,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:43,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:44,002 INFO L124 PetriNetUnfolderBase]: 684/1365 cut-off events. [2023-11-21 22:26:44,003 INFO L125 PetriNetUnfolderBase]: For 1330/1330 co-relation queries the response was YES. [2023-11-21 22:26:44,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4463 conditions, 1365 events. 684/1365 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8743 event pairs, 164 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 4448. Up to 516 conditions per place. [2023-11-21 22:26:44,013 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 53 selfloop transitions, 23 changer transitions 0/89 dead transitions. [2023-11-21 22:26:44,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 663 flow [2023-11-21 22:26:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:26:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:26:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2023-11-21 22:26:44,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28401360544217685 [2023-11-21 22:26:44,015 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 167 transitions. [2023-11-21 22:26:44,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 167 transitions. [2023-11-21 22:26:44,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:44,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 167 transitions. [2023-11-21 22:26:44,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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:26:44,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:26:44,019 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:26:44,019 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 354 flow. Second operand 6 states and 167 transitions. [2023-11-21 22:26:44,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 663 flow [2023-11-21 22:26:44,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:44,025 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 403 flow [2023-11-21 22:26:44,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2023-11-21 22:26:44,026 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-11-21 22:26:44,026 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 403 flow [2023-11-21 22:26:44,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:44,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:44,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:44,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:26:44,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:44,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 630678200, now seen corresponding path program 1 times [2023-11-21 22:26:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:44,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994428202] [2023-11-21 22:26:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:26:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994428202] [2023-11-21 22:26:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994428202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:26:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373650250] [2023-11-21 22:26:44,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:44,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:26:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:26:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:26:44,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:26:44,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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:26:44,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:44,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:26:44,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:44,582 INFO L124 PetriNetUnfolderBase]: 682/1428 cut-off events. [2023-11-21 22:26:44,582 INFO L125 PetriNetUnfolderBase]: For 1307/1307 co-relation queries the response was YES. [2023-11-21 22:26:44,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 1428 events. 682/1428 cut-off events. For 1307/1307 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9620 event pairs, 120 based on Foata normal form. 24/1304 useless extension candidates. Maximal degree in co-relation 4554. Up to 648 conditions per place. [2023-11-21 22:26:44,593 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 41 selfloop transitions, 27 changer transitions 0/81 dead transitions. [2023-11-21 22:26:44,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 595 flow [2023-11-21 22:26:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:26:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:26:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2023-11-21 22:26:44,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-11-21 22:26:44,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 126 transitions. [2023-11-21 22:26:44,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 126 transitions. [2023-11-21 22:26:44,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:44,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 126 transitions. [2023-11-21 22:26:44,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:26:44,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:44,598 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:44,598 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 403 flow. Second operand 4 states and 126 transitions. [2023-11-21 22:26:44,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 595 flow [2023-11-21 22:26:44,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:44,603 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 431 flow [2023-11-21 22:26:44,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2023-11-21 22:26:44,603 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-11-21 22:26:44,603 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 431 flow [2023-11-21 22:26:44,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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:26:44,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:44,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:44,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:26:44,604 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:44,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash 494934861, now seen corresponding path program 1 times [2023-11-21 22:26:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:44,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064389697] [2023-11-21 22:26:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:44,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:26:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064389697] [2023-11-21 22:26:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064389697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508052034] [2023-11-21 22:26:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:26:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:26:44,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:26:44,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-21 22:26:44,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:26:44,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:44,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-21 22:26:44,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:45,689 INFO L124 PetriNetUnfolderBase]: 1598/3121 cut-off events. [2023-11-21 22:26:45,689 INFO L125 PetriNetUnfolderBase]: For 3874/3882 co-relation queries the response was YES. [2023-11-21 22:26:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9952 conditions, 3121 events. 1598/3121 cut-off events. For 3874/3882 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 23305 event pairs, 875 based on Foata normal form. 1/2659 useless extension candidates. Maximal degree in co-relation 9937. Up to 1196 conditions per place. [2023-11-21 22:26:45,709 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 96 selfloop transitions, 6 changer transitions 8/120 dead transitions. [2023-11-21 22:26:45,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 120 transitions, 1079 flow [2023-11-21 22:26:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:26:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:26:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2023-11-21 22:26:45,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29591836734693877 [2023-11-21 22:26:45,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 145 transitions. [2023-11-21 22:26:45,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 145 transitions. [2023-11-21 22:26:45,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:45,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 145 transitions. [2023-11-21 22:26:45,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.0) internal successors, (145), 5 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:26:45,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:45,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:45,719 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 431 flow. Second operand 5 states and 145 transitions. [2023-11-21 22:26:45,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 120 transitions, 1079 flow [2023-11-21 22:26:45,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:45,726 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 452 flow [2023-11-21 22:26:45,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2023-11-21 22:26:45,727 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-21 22:26:45,728 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 452 flow [2023-11-21 22:26:45,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:26:45,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:45,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:45,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:26:45,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:45,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash 494935936, now seen corresponding path program 1 times [2023-11-21 22:26:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499605883] [2023-11-21 22:26:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:45,995 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:26:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499605883] [2023-11-21 22:26:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499605883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:45,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909163761] [2023-11-21 22:26:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:45,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:26:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:26:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:26:46,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:26:46,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:46,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:26:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:47,078 INFO L124 PetriNetUnfolderBase]: 1884/3770 cut-off events. [2023-11-21 22:26:47,078 INFO L125 PetriNetUnfolderBase]: For 5067/5286 co-relation queries the response was YES. [2023-11-21 22:26:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 3770 events. 1884/3770 cut-off events. For 5067/5286 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 30423 event pairs, 493 based on Foata normal form. 1/3423 useless extension candidates. Maximal degree in co-relation 12447. Up to 1506 conditions per place. [2023-11-21 22:26:47,104 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 84 selfloop transitions, 47 changer transitions 0/144 dead transitions. [2023-11-21 22:26:47,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 144 transitions, 1192 flow [2023-11-21 22:26:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:26:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:26:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2023-11-21 22:26:47,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2844387755102041 [2023-11-21 22:26:47,107 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 223 transitions. [2023-11-21 22:26:47,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 223 transitions. [2023-11-21 22:26:47,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:47,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 223 transitions. [2023-11-21 22:26:47,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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:26:47,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:26:47,112 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:26:47,112 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 452 flow. Second operand 8 states and 223 transitions. [2023-11-21 22:26:47,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 144 transitions, 1192 flow [2023-11-21 22:26:47,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 1192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:26:47,132 INFO L231 Difference]: Finished difference. Result has 75 places, 90 transitions, 788 flow [2023-11-21 22:26:47,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=788, PETRI_PLACES=75, PETRI_TRANSITIONS=90} [2023-11-21 22:26:47,134 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2023-11-21 22:26:47,134 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 788 flow [2023-11-21 22:26:47,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:47,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:47,134 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:26:47,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:26:47,135 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:47,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1836887150, now seen corresponding path program 1 times [2023-11-21 22:26:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:47,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156510735] [2023-11-21 22:26:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:47,362 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:26:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156510735] [2023-11-21 22:26:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156510735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:26:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892620553] [2023-11-21 22:26:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:47,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:26:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:26:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:26:47,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-21 22:26:47,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 788 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:26:47,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:47,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-21 22:26:47,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:47,909 INFO L124 PetriNetUnfolderBase]: 1316/2556 cut-off events. [2023-11-21 22:26:47,909 INFO L125 PetriNetUnfolderBase]: For 3460/3535 co-relation queries the response was YES. [2023-11-21 22:26:47,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8282 conditions, 2556 events. 1316/2556 cut-off events. For 3460/3535 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17012 event pairs, 192 based on Foata normal form. 83/2467 useless extension candidates. Maximal degree in co-relation 8256. Up to 1719 conditions per place. [2023-11-21 22:26:47,921 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 82 selfloop transitions, 4 changer transitions 1/99 dead transitions. [2023-11-21 22:26:47,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 949 flow [2023-11-21 22:26:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:26:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:26:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2023-11-21 22:26:47,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2023-11-21 22:26:47,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 119 transitions. [2023-11-21 22:26:47,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 119 transitions. [2023-11-21 22:26:47,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:47,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 119 transitions. [2023-11-21 22:26:47,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:47,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:47,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:26:47,926 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 788 flow. Second operand 4 states and 119 transitions. [2023-11-21 22:26:47,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 949 flow [2023-11-21 22:26:47,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 835 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:47,950 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 511 flow [2023-11-21 22:26:47,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-11-21 22:26:47,951 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-21 22:26:47,952 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 511 flow [2023-11-21 22:26:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:26:47,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:47,952 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:26:47,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:26:47,953 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:47,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1734340981, now seen corresponding path program 1 times [2023-11-21 22:26:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806246172] [2023-11-21 22:26:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:48,224 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:26:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806246172] [2023-11-21 22:26:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806246172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300026507] [2023-11-21 22:26:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:48,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:26:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:26:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:26:48,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-21 22:26:48,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 511 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:26:48,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:48,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-21 22:26:48,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:48,876 INFO L124 PetriNetUnfolderBase]: 1021/2102 cut-off events. [2023-11-21 22:26:48,876 INFO L125 PetriNetUnfolderBase]: For 2336/2398 co-relation queries the response was YES. [2023-11-21 22:26:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 2102 events. 1021/2102 cut-off events. For 2336/2398 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14801 event pairs, 505 based on Foata normal form. 11/1969 useless extension candidates. Maximal degree in co-relation 6817. Up to 1490 conditions per place. [2023-11-21 22:26:48,888 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 79 selfloop transitions, 18 changer transitions 5/115 dead transitions. [2023-11-21 22:26:48,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 115 transitions, 920 flow [2023-11-21 22:26:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:26:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:26:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2023-11-21 22:26:48,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2614795918367347 [2023-11-21 22:26:48,890 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 205 transitions. [2023-11-21 22:26:48,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 205 transitions. [2023-11-21 22:26:48,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:48,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 205 transitions. [2023-11-21 22:26:48,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 25.625) internal successors, (205), 8 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:26:48,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:26:48,894 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:26:48,894 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 511 flow. Second operand 8 states and 205 transitions. [2023-11-21 22:26:48,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 115 transitions, 920 flow [2023-11-21 22:26:48,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 911 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:48,917 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 622 flow [2023-11-21 22:26:48,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2023-11-21 22:26:48,918 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-11-21 22:26:48,918 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 622 flow [2023-11-21 22:26:48,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:26:48,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:48,919 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:26:48,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:26:48,919 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:48,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1212221915, now seen corresponding path program 1 times [2023-11-21 22:26:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799636642] [2023-11-21 22:26:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26: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:26:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799636642] [2023-11-21 22:26:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799636642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333312463] [2023-11-21 22:26:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:26:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:26:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:26:49,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-21 22:26:49,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:49,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:49,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-21 22:26:49,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:49,723 INFO L124 PetriNetUnfolderBase]: 899/1924 cut-off events. [2023-11-21 22:26:49,723 INFO L125 PetriNetUnfolderBase]: For 2902/2905 co-relation queries the response was YES. [2023-11-21 22:26:49,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6609 conditions, 1924 events. 899/1924 cut-off events. For 2902/2905 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 13730 event pairs, 432 based on Foata normal form. 84/1849 useless extension candidates. Maximal degree in co-relation 6576. Up to 962 conditions per place. [2023-11-21 22:26:49,733 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 52 selfloop transitions, 11 changer transitions 8/89 dead transitions. [2023-11-21 22:26:49,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 89 transitions, 790 flow [2023-11-21 22:26:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:26:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:26:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2023-11-21 22:26:49,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24489795918367346 [2023-11-21 22:26:49,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 120 transitions. [2023-11-21 22:26:49,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 120 transitions. [2023-11-21 22:26:49,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:49,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 120 transitions. [2023-11-21 22:26:49,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.0) internal successors, (120), 5 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:26:49,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:49,738 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:49,738 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 622 flow. Second operand 5 states and 120 transitions. [2023-11-21 22:26:49,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 89 transitions, 790 flow [2023-11-21 22:26:49,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 765 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-21 22:26:49,765 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 549 flow [2023-11-21 22:26:49,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2023-11-21 22:26:49,766 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2023-11-21 22:26:49,766 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 549 flow [2023-11-21 22:26:49,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:49,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:49,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:49,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:26:49,767 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:49,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -474425920, now seen corresponding path program 1 times [2023-11-21 22:26:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659270822] [2023-11-21 22:26:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:49,965 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:26:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659270822] [2023-11-21 22:26:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659270822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:49,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:49,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:26:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334143106] [2023-11-21 22:26:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:49,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:26:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:26:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:26:49,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-21 22:26:49,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:49,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:49,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-21 22:26:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:50,284 INFO L124 PetriNetUnfolderBase]: 432/854 cut-off events. [2023-11-21 22:26:50,284 INFO L125 PetriNetUnfolderBase]: For 1049/1058 co-relation queries the response was YES. [2023-11-21 22:26:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 854 events. 432/854 cut-off events. For 1049/1058 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4159 event pairs, 54 based on Foata normal form. 57/851 useless extension candidates. Maximal degree in co-relation 2802. Up to 300 conditions per place. [2023-11-21 22:26:50,290 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 41 selfloop transitions, 6 changer transitions 5/62 dead transitions. [2023-11-21 22:26:50,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 514 flow [2023-11-21 22:26:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:26:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:26:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2023-11-21 22:26:50,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2530612244897959 [2023-11-21 22:26:50,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 124 transitions. [2023-11-21 22:26:50,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 124 transitions. [2023-11-21 22:26:50,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:50,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 124 transitions. [2023-11-21 22:26:50,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:50,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:50,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:26:50,296 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 549 flow. Second operand 5 states and 124 transitions. [2023-11-21 22:26:50,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 514 flow [2023-11-21 22:26:50,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 376 flow, removed 15 selfloop flow, removed 19 redundant places. [2023-11-21 22:26:50,302 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 194 flow [2023-11-21 22:26:50,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-11-21 22:26:50,303 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-11-21 22:26:50,303 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 194 flow [2023-11-21 22:26:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:50,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:50,304 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:26:50,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:26:50,304 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:50,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1047218423, now seen corresponding path program 1 times [2023-11-21 22:26:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:50,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91776526] [2023-11-21 22:26:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:26:50,633 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:26:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:26:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91776526] [2023-11-21 22:26:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91776526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:26:50,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:26:50,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:26:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820688643] [2023-11-21 22:26:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:26:50,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:26:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:26:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:26:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:26:50,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 98 [2023-11-21 22:26:50,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:50,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:26:50,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 98 [2023-11-21 22:26:50,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:26:50,912 INFO L124 PetriNetUnfolderBase]: 332/703 cut-off events. [2023-11-21 22:26:50,912 INFO L125 PetriNetUnfolderBase]: For 469/477 co-relation queries the response was YES. [2023-11-21 22:26:50,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 703 events. 332/703 cut-off events. For 469/477 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3510 event pairs, 80 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 1954. Up to 271 conditions per place. [2023-11-21 22:26:50,915 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 21 selfloop transitions, 3 changer transitions 31/66 dead transitions. [2023-11-21 22:26:50,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 388 flow [2023-11-21 22:26:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:26:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:26:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2023-11-21 22:26:50,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22886297376093295 [2023-11-21 22:26:50,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 157 transitions. [2023-11-21 22:26:50,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 157 transitions. [2023-11-21 22:26:50,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:26:50,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 157 transitions. [2023-11-21 22:26:50,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 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:26:50,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:26:50,921 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:26:50,921 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 194 flow. Second operand 7 states and 157 transitions. [2023-11-21 22:26:50,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 388 flow [2023-11-21 22:26:50,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 339 flow, removed 13 selfloop flow, removed 9 redundant places. [2023-11-21 22:26:50,926 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 119 flow [2023-11-21 22:26:50,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2023-11-21 22:26:50,927 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-11-21 22:26:50,927 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 119 flow [2023-11-21 22:26:50,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:26:50,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:26:50,927 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:26:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:26:50,928 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:26:50,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:26:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 300261455, now seen corresponding path program 2 times [2023-11-21 22:26:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:26:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957132039] [2023-11-21 22:26:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:26:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:26:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:26:51,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:26:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:26:51,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:26:51,187 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:26:51,189 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2023-11-21 22:26:51,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2023-11-21 22:26:51,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2023-11-21 22:26:51,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2023-11-21 22:26:51,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2023-11-21 22:26:51,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2023-11-21 22:26:51,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2023-11-21 22:26:51,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2023-11-21 22:26:51,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2023-11-21 22:26:51,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2023-11-21 22:26:51,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2023-11-21 22:26:51,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2023-11-21 22:26:51,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2023-11-21 22:26:51,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2023-11-21 22:26:51,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2023-11-21 22:26:51,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2023-11-21 22:26:51,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2023-11-21 22:26:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2023-11-21 22:26:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2023-11-21 22:26:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2023-11-21 22:26:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2023-11-21 22:26:51,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2023-11-21 22:26:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2023-11-21 22:26:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2023-11-21 22:26:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2023-11-21 22:26:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2023-11-21 22:26:51,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2023-11-21 22:26:51,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2023-11-21 22:26:51,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2023-11-21 22:26:51,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2023-11-21 22:26:51,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2023-11-21 22:26:51,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2023-11-21 22:26:51,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2023-11-21 22:26:51,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2023-11-21 22:26:51,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2023-11-21 22:26:51,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2023-11-21 22:26:51,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2023-11-21 22:26:51,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2023-11-21 22:26:51,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2023-11-21 22:26:51,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2023-11-21 22:26:51,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2023-11-21 22:26:51,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2023-11-21 22:26:51,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2023-11-21 22:26:51,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2023-11-21 22:26:51,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2023-11-21 22:26:51,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2023-11-21 22:26:51,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2023-11-21 22:26:51,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2023-11-21 22:26:51,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2023-11-21 22:26:51,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2023-11-21 22:26:51,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2023-11-21 22:26:51,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2023-11-21 22:26:51,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2023-11-21 22:26:51,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2023-11-21 22:26:51,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2023-11-21 22:26:51,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2023-11-21 22:26:51,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2023-11-21 22:26:51,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2023-11-21 22:26:51,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2023-11-21 22:26:51,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2023-11-21 22:26:51,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2023-11-21 22:26:51,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2023-11-21 22:26:51,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2023-11-21 22:26:51,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2023-11-21 22:26:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 22:26:51,205 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:26:51,214 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:26:51,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:26:51,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-21 22:26:51,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-21 22:26:51,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:26:51,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 22:26:51,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:26:51 BasicIcfg [2023-11-21 22:26:51,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:26:51,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:26:51,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:26:51,374 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:26:51,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:26:31" (3/4) ... [2023-11-21 22:26:51,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:26:51,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:26:51,379 INFO L158 Benchmark]: Toolchain (without parser) took 22755.82ms. Allocated memory was 125.8MB in the beginning and 989.9MB in the end (delta: 864.0MB). Free memory was 79.7MB in the beginning and 667.3MB in the end (delta: -587.6MB). Peak memory consumption was 278.9MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,379 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 125.8MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:26:51,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.54ms. Allocated memory is still 125.8MB. Free memory was 79.7MB in the beginning and 55.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.56ms. Allocated memory is still 125.8MB. Free memory was 55.4MB in the beginning and 52.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,380 INFO L158 Benchmark]: Boogie Preprocessor took 70.27ms. Allocated memory is still 125.8MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,381 INFO L158 Benchmark]: RCFGBuilder took 1752.44ms. Allocated memory was 125.8MB in the beginning and 190.8MB in the end (delta: 65.0MB). Free memory was 50.4MB in the beginning and 77.2MB in the end (delta: -26.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,381 INFO L158 Benchmark]: TraceAbstraction took 20076.85ms. Allocated memory was 190.8MB in the beginning and 989.9MB in the end (delta: 799.0MB). Free memory was 77.2MB in the beginning and 667.3MB in the end (delta: -590.1MB). Peak memory consumption was 208.8MB. Max. memory is 16.1GB. [2023-11-21 22:26:51,382 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 989.9MB. Free memory is still 667.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:26:51,384 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.24ms. Allocated memory is still 125.8MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.54ms. Allocated memory is still 125.8MB. Free memory was 79.7MB in the beginning and 55.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.56ms. Allocated memory is still 125.8MB. Free memory was 55.4MB in the beginning and 52.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.27ms. Allocated memory is still 125.8MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1752.44ms. Allocated memory was 125.8MB in the beginning and 190.8MB in the end (delta: 65.0MB). Free memory was 50.4MB in the beginning and 77.2MB in the end (delta: -26.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20076.85ms. Allocated memory was 190.8MB in the beginning and 989.9MB in the end (delta: 799.0MB). Free memory was 77.2MB in the beginning and 667.3MB in the end (delta: -590.1MB). Peak memory consumption was 208.8MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 989.9MB. Free memory is still 667.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L17] 0 __assert_fail ("0", "safe006_power.opt-thin000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: -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: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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 5 procedures, 111 locations, 64 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: 19.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 771 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1933 IncrementalHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 51 mSDtfsCounter, 1933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=788occurred in iteration=13, InterpolantAutomatonStates: 80, 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.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:26:51,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:26:54,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:26:54,211 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:26:54,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:26:54,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:26:54,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:26:54,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:26:54,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:26:54,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:26:54,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:26:54,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:26:54,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:26:54,265 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:26:54,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:26:54,267 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:26:54,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:26:54,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:26:54,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:26:54,269 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:26:54,269 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:26:54,270 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:26:54,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:26:54,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:26:54,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:26:54,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:26:54,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:26:54,273 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:26:54,274 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:26:54,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:26:54,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:26:54,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:26:54,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:26:54,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:54,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:26:54,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:26:54,278 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:26:54,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:26:54,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:26:54,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:26:54,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:26:54,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:26:54,281 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:26:54,281 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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2023-11-21 22:26:54,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:26:54,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:26:54,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:26:54,703 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:26:54,703 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:26:54,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-21 22:26:58,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:26:58,443 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:26:58,444 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-11-21 22:26:58,470 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/7c10e4cc0/639fac74787c473d9c1df94ccce000c9/FLAGc1f155456 [2023-11-21 22:26:58,487 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/data/7c10e4cc0/639fac74787c473d9c1df94ccce000c9 [2023-11-21 22:26:58,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:26:58,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:26:58,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:58,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:26:58,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:26:58,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:58" (1/1) ... [2023-11-21 22:26:58,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b33d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:58, skipping insertion in model container [2023-11-21 22:26:58,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:26:58" (1/1) ... [2023-11-21 22:26:58,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:26:59,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:59,245 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:26:59,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:26:59,431 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:59,446 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:26:59,454 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:26:59,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59 WrapperNode [2023-11-21 22:26:59,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:26:59,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:59,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:26:59,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:26:59,465 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:26:59" (1/1) ... [2023-11-21 22:26:59,503 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:26:59" (1/1) ... [2023-11-21 22:26:59,564 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-21 22:26:59,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:26:59,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:26:59,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:26:59,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:26:59,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:26:59,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:26:59,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:26:59,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:26:59,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (1/1) ... [2023-11-21 22:26:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:26:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:26:59,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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:26:59,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/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:26:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-21 22:26:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:26:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:26:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:26:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:26:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:26:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:26:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-21 22:26:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:26:59,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:26:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:26:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:26:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:26:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:26:59,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:26:59,756 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:27:00,002 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:27:00,005 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:27:00,637 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:27:01,387 WARN L1820 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-21 22:27:01,580 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:27:01,581 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:27:01,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:01 BoogieIcfgContainer [2023-11-21 22:27:01,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:27:01,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:27:01,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:27:01,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:27:01,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:26:58" (1/3) ... [2023-11-21 22:27:01,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee842c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:01, skipping insertion in model container [2023-11-21 22:27:01,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:26:59" (2/3) ... [2023-11-21 22:27:01,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee842c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:01, skipping insertion in model container [2023-11-21 22:27:01,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:01" (3/3) ... [2023-11-21 22:27:01,595 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-11-21 22:27:01,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:27:01,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-21 22:27:01,617 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:27:01,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:27:01,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 98 transitions, 204 flow [2023-11-21 22:27:02,024 INFO L124 PetriNetUnfolderBase]: 29/96 cut-off events. [2023-11-21 22:27:02,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:02,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 29/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 293 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-21 22:27:02,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 98 transitions, 204 flow [2023-11-21 22:27:02,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 96 transitions, 198 flow [2023-11-21 22:27:02,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:02,069 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;@1d970c90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:02,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-11-21 22:27:02,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:02,076 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 22:27:02,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:02,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:02,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:27:02,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:27:02,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 25051, now seen corresponding path program 1 times [2023-11-21 22:27:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:02,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512267013] [2023-11-21 22:27:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:02,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:27:02,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-21 22:27:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:02,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:27:02,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:02,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:27:02,359 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:27:02,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:02,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512267013] [2023-11-21 22:27:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512267013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434382712] [2023-11-21 22:27:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:02,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:02,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-21 22:27:02,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27:02,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:02,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-21 22:27:02,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:04,292 INFO L124 PetriNetUnfolderBase]: 2747/4560 cut-off events. [2023-11-21 22:27:04,292 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-21 22:27:04,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 4560 events. 2747/4560 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33290 event pairs, 2020 based on Foata normal form. 180/2149 useless extension candidates. Maximal degree in co-relation 8688. Up to 3561 conditions per place. [2023-11-21 22:27:04,346 INFO L140 encePairwiseOnDemand]: 55/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-21 22:27:04,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 272 flow [2023-11-21 22:27:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-21 22:27:04,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-21 22:27:04,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-21 22:27:04,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-21 22:27:04,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:04,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-21 22:27:04,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:27:04,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:04,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:04,385 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 198 flow. Second operand 3 states and 189 transitions. [2023-11-21 22:27:04,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 272 flow [2023-11-21 22:27:04,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:04,396 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 116 flow [2023-11-21 22:27:04,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-11-21 22:27:04,401 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-11-21 22:27:04,402 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 116 flow [2023-11-21 22:27:04,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27:04,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:04,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 22:27:04,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-21 22:27:04,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:04,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:27:04,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 25052, now seen corresponding path program 1 times [2023-11-21 22:27:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:04,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670860270] [2023-11-21 22:27:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:04,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:27:04,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-21 22:27:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:04,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:27:04,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:04,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:27:04,763 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:27:04,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:04,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670860270] [2023-11-21 22:27:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670860270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:04,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:04,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441635402] [2023-11-21 22:27:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:04,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:04,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:27:04,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:27:04,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:04,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:27:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:06,220 INFO L124 PetriNetUnfolderBase]: 2747/4559 cut-off events. [2023-11-21 22:27:06,221 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-21 22:27:06,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 4559 events. 2747/4559 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 33250 event pairs, 2020 based on Foata normal form. 1/1969 useless extension candidates. Maximal degree in co-relation 8778. Up to 3560 conditions per place. [2023-11-21 22:27:06,266 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-21 22:27:06,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 270 flow [2023-11-21 22:27:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:27:06,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-21 22:27:06,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:27:06,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:27:06,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:06,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:27:06,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:06,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:06,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:06,288 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 116 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:27:06,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 270 flow [2023-11-21 22:27:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:06,299 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 114 flow [2023-11-21 22:27:06,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-21 22:27:06,300 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-11-21 22:27:06,301 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 114 flow [2023-11-21 22:27:06,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:27:06,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:06,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:27:06,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:27:06,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:06,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:27:06,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 747155566, now seen corresponding path program 1 times [2023-11-21 22:27:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881365577] [2023-11-21 22:27:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:06,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:06,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:27:06,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-21 22:27:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:06,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:27:06,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:06,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:27:06,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:27:06,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:06,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881365577] [2023-11-21 22:27:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881365577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:06,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942212039] [2023-11-21 22:27:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:06,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 98 [2023-11-21 22:27:06,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:27:06,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:06,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 98 [2023-11-21 22:27:06,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:07,796 INFO L124 PetriNetUnfolderBase]: 2755/4519 cut-off events. [2023-11-21 22:27:07,796 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-21 22:27:07,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4519 events. 2755/4519 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 32808 event pairs, 2080 based on Foata normal form. 0/1929 useless extension candidates. Maximal degree in co-relation 8755. Up to 3567 conditions per place. [2023-11-21 22:27:07,840 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 57 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-21 22:27:07,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 270 flow [2023-11-21 22:27:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-21 22:27:07,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2023-11-21 22:27:07,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-21 22:27:07,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-21 22:27:07,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:07,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-21 22:27:07,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:07,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:07,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:07,846 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 114 flow. Second operand 3 states and 111 transitions. [2023-11-21 22:27:07,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 270 flow [2023-11-21 22:27:07,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:07,855 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 112 flow [2023-11-21 22:27:07,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-11-21 22:27:07,856 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-11-21 22:27:07,856 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 112 flow [2023-11-21 22:27:07,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:27:07,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:07,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 22:27:07,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:27:08,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:08,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:27:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 747155567, now seen corresponding path program 1 times [2023-11-21 22:27:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442328951] [2023-11-21 22:27:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:08,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:27:08,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-21 22:27:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:08,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:27:08,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:27:08,216 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:27:08,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:08,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442328951] [2023-11-21 22:27:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442328951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943836370] [2023-11-21 22:27:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:08,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:08,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 98 [2023-11-21 22:27:08,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:27:08,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:08,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 98 [2023-11-21 22:27:08,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:09,344 INFO L124 PetriNetUnfolderBase]: 2747/4495 cut-off events. [2023-11-21 22:27:09,344 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-11-21 22:27:09,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 4495 events. 2747/4495 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 32048 event pairs, 2072 based on Foata normal form. 9/1936 useless extension candidates. Maximal degree in co-relation 8723. Up to 3550 conditions per place. [2023-11-21 22:27:09,380 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 56 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-21 22:27:09,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 266 flow [2023-11-21 22:27:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-21 22:27:09,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2023-11-21 22:27:09,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-21 22:27:09,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-21 22:27:09,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:09,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-21 22:27:09,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:09,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:09,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:09,385 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 112 flow. Second operand 3 states and 113 transitions. [2023-11-21 22:27:09,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 266 flow [2023-11-21 22:27:09,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:09,392 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 110 flow [2023-11-21 22:27:09,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=110, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-11-21 22:27:09,393 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-11-21 22:27:09,394 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 110 flow [2023-11-21 22:27:09,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:27:09,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:09,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:27:09,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:27:09,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:09,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-11-21 22:27:09,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1687067226, now seen corresponding path program 1 times [2023-11-21 22:27:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:27:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292534175] [2023-11-21 22:27:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:27:09,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:27:09,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:27:09,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12af5af4-6b5f-486b-9eb4-ff107ffc9dd3/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-21 22:27:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:09,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:27:09,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:09,726 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:27:09,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:27:09,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:27:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292534175] [2023-11-21 22:27:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292534175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:09,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:27:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047145495] [2023-11-21 22:27:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:27:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:09,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 98 [2023-11-21 22:27:09,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:27:09,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:09,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 98 [2023-11-21 22:27:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:11,028 INFO L124 PetriNetUnfolderBase]: 3591/6011 cut-off events. [2023-11-21 22:27:11,028 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-21 22:27:11,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11712 conditions, 6011 events. 3591/6011 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 48114 event pairs, 812 based on Foata normal form. 0/2736 useless extension candidates. Maximal degree in co-relation 11702. Up to 3214 conditions per place. [2023-11-21 22:27:11,065 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 65 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-11-21 22:27:11,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 312 flow [2023-11-21 22:27:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-21 22:27:11,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2023-11-21 22:27:11,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-21 22:27:11,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-21 22:27:11,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:11,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-21 22:27:11,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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:27:11,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:27:11,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)